Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
It is conjectured that within the class group of any number field, for every integer $\ell \geq 1$, the $\ell$-torsion subgroup… Expand
2017
2017
Abstract Improving our earlier result we show that for every integer k ≥ 1 there exists a c ( k ) such that in every 2-colored… Expand
2016
2016
NSF [DMS-1302886, DMS-1201374]; Prometeo/Generalitat Valenciana [MTM2013-40464-P]; Simons Foundation Fellowship [305247] 
2015
2015
  • T. Abe
  • 2015
  • Corpus ID: 119308534
Let $$({\mathcal {A}},{\mathcal {A}}',{\mathcal {A}}^H)$$(A,A′,AH) be the triple of hyperplane arrangements. We show that the… Expand
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… Expand
  • figure 1
  • figure 2
  • figure III
  • figure VI
  • figure VI
Review
2014
Review
2014
Many real-world phenomena can be modelled using networks. Often, these networks interact with one another in non-trivial ways… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
2010
2010
Abstract We give a concise exposition of the elegant proof given recently by Leonid Gurvits for several lower bounds on… Expand
2001
2001
We investigate the evolution of different measures of `gravitational entropy' in Bianchi type I and Lemaitre-Tolman universe… Expand
1983
1983
The Gyarfas-Lehel tree-packing conjecture asserts that any sequence T1, T2, …, Tn−1 of trees with 1, 2, …, n - 1 edges packs into… Expand