In graph theory, the unproven Erdős–Gyárfás conjecture, made in 1995 by the prolific mathematician Paul Erdős and his collaborator András Gyárfás… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi
- Discussiones Mathematicae Graph Theory
- 2014

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2… (More)

Is this relevant?

2014

2014

We develop a rigorous and interpretable statistical model for networks using their shell structure to construct minimal… (More)

Is this relevant?

2008

2008

- Mark Brittenhama, Stuart W. Margolis, John Meakin
- 2008

Let S be a semigroup with set E(S) of idempotents, and let 〈E(S)〉 denote the subsemigroup of S generated by E(S). We say that S… (More)

Is this relevant?

2004

2004

- OMITTABLE POINTS
- 2004

One of the well known questions in elementary combinatorial geometry requires the proof of the assertion that for every finite… (More)

Is this relevant?

1999

1999

Ratzeburgiola Erdös is a small but phylogenetically interesting genus exhibiting a combination of characters once used to define… (More)

Is this relevant?