Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,448 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.
Review
2019
Review
2019
On the Resolution of the Sensitivity Conjecture
Rohan Karthikeyan
,
Siddharth Sinha
,
V. Patil
Bulletin of the American Mathematical Society
2019
Corpus ID: 209202569
The Sensitivity Conjecture is a long-standing problem in theoretical computer science that seeks to fit the sensitivity of a…
Expand
2017
2017
Monochromatic cycle power partitions
G. N. Sárközy
Discrete Mathematics
2017
Corpus ID: 26326711
2016
2016
Finite groups with odd Sylow normalizers
R. Guralnick
,
G. Navarro
,
P. Tiep
2016
Corpus ID: 119255750
NSF [DMS-1302886, DMS-1201374]; Prometeo/Generalitat Valenciana [MTM2013-40464-P]; Simons Foundation Fellowship [305247]
2016
2016
Fourier–Jacobi periods and the central value of Rankin–Selberg L-functions
Hang Xue
2016
Corpus ID: 42396344
In this paper, we propose a conjectural formula, relating the Fourier–Jacobi periods of automorphic forms on U(n)×U(n) and the…
Expand
Review
2014
Review
2014
An Introduction to Interdependent Networks
M. M. Danziger
,
A. Bashan
,
Y. Berezin
,
L. Shekhtman
,
S. Havlin
2014
Corpus ID: 53590798
Many real-world phenomena can be modelled using networks. Often, these networks interact with one another in non-trivial ways…
Expand
2013
2013
Erdös-Gyárfás Conjecture for Cubic Planar Graphs
C. Heckman
,
Roi Krakovski
Electronic Journal of Combinatorics
2013
Corpus ID: 13843654
In 1995, Paul Erdos and Andras Gyarfas conjectured that for every graph of minimum degree at least 3, there exists a non-negative…
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
2010
2010
On Leonid Gurvits’s Proof for Permanents
M. Laurent
,
A. Schrijver
The American mathematical monthly
2010
Corpus ID: 2362905
Abstract We give a concise exposition of the elegant proof given recently by Leonid Gurvits for several lower bounds on…
Expand
2009
2009
Special homogeneous linear systems on Hirzebruch surfaces
M. Dumnicki
2009
Corpus ID: 16640997
The Segre-Gimigliano-Harbourne-Hirschowitz Conjecture can be naturally formulated for Hirzebruch surfaces $${\mathbb{F}_n}$$. We…
Expand
2002
2002
Sums of subsets with polynomial restrictions
Jianxi Liu
,
Zhi-Wei Sun
2002
Corpus ID: 123564070
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