Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,325,428 papers from all fields of science
Search
Sign In
Create Free Account
Erdős–Gyárfás conjecture
Known as:
Erdös conjecture (graph theory)
, Markström graph
, Erdos conjecture (graph theory)
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Claw-free graph
Cycle (graph theory)
Gordon Royle
Graph (discrete mathematics)
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Dimitrov's question for the polynomials of degree 1,2,3,4,5,6.
D. Dmitrishin
,
I. Skrinnik
,
A. Smorodin
,
A. Stokolos
2018
Corpus ID: 119324923
In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter…
Expand
2018
2018
On two consequences of Berge-Fulkerson conjecture
V. Mkrtchyan
,
Gagik N. Vardanyan
AKCE Int. J. Graphs Comb.
2018
Corpus ID: 21709405
2015
2015
Intersections of Cycles in $$k$$k-Connected Graphs
Jessica Chen
,
Le Chen
,
D. Liu
Graphs Comb.
2015
Corpus ID: 42844053
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…
Expand
2015
2015
Periods and line arrangements : contributions to the Kontsevich-Zagier period conjecture and to the Terao conjecture.
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…
Expand
2013
2013
FREENESS OF LINE ARRANGEMENTS WITH MANY CONCURRENT LINES
Daniele Faenzi
2013
Corpus ID: 96428313
We propose here a new approach in order to study line arrangements on the projective plane. We use this approach to prove Terao’s…
Expand
2012
2012
New methods for determining speciality of linear systems based at fat points in Pn
Stepan Paul
2012
Corpus ID: 119169989
2012
2012
Freeness of line arrangements
J. Vallès
2012
Corpus ID: 54004393
In this work in common with Daniele Faenzi we describe the logarithmic bundle associated to a arrangement of lines in P(C) as the…
Expand
2001
2001
2 9 N ov 2 00 1 Node polynomials for families : results and examples By
S. Kleiman
,
R. Piene
2001
Corpus ID: 15972787
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity…
Expand
1997
1997
On explicit construction of Hilbert-Siegel modular forms of degree two
H. Kojima
1997
Corpus ID: 54976334
Introduction. Several authors have developed the theory of lifting from the space of modular forms of one variable to that of…
Expand
1972
1972
DEDICATED TO THE MEMORY OF THEODORE S. MOTZKIN
R. Graham
1972
Corpus ID: 15576028
Eucl dean Ramsey Theorems . I P . ERDöS Mathemat cs Inst tute, Hungar an Academy of Sc ence, Budapest 9, Hungary R. L. GRAHAM…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE