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
In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter… 
2018
2018
2015
2015
Let $$k\ge 2$$k≥2 be a positive integer and $$G$$G be a $$k$$k-connected graph. We prove that for any two cycles $$C$$C and $$D… 
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… 
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… 
2012
2012
In this work in common with Daniele Faenzi we describe the logarithmic bundle associated to a arrangement of lines in P(C) as the… 
2001
2001
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity… 
1997
1997
Introduction. Several authors have developed the theory of lifting from the space of modular forms of one variable to that of… 
1972
1972
Eucl dean Ramsey Theorems . I P . ERDöS Mathemat cs Inst tute, Hungar an Academy of Sc ence, Budapest 9, Hungary R. L. GRAHAM…