Skip to search formSkip to main contentSkip to account menu

Erdős–Gyárfás conjecture

Known as: Erdös conjecture (graph theory), Markström graph, Erdos conjecture (graph theory) 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number k ≥ 0 of hamiltonian cycles… 
2017
2017
2016
2016
NSF [DMS-1302886, DMS-1201374]; Prometeo/Generalitat Valenciana [MTM2013-40464-P]; Simons Foundation Fellowship [305247] 
2015
2015
  • J. Sos
  • 2015
  • Corpus ID: 124004190
The principal motivation of the present Ph.D subject is the study of certain interactions between number theory, algebraic… 
Review
2014
Review
2014
Many real-world phenomena can be modelled using networks. Often, these networks interact with one another in non-trivial ways… 
2013
2013
In 1995, Paul Erdos and Andras Gyarfas conjectured that for every graph of minimum degree at least 3, there exists a non-negative… 
2013
2013
We propose here a new approach in order to study line arrangements on the projective plane. We use this approach to prove Terao’s… 
2010
2010
Abstract We give a concise exposition of the elegant proof given recently by Leonid Gurvits for several lower bounds on…