Erdős–Burr conjecture

Known as: Erdos-Burr conjecture, Erdos–Burr conjecture, Erdős-Burr conjecture 
In mathematics, the Erdős–Burr conjecture is a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Paul Erdős and… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1940-2017
051019402016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Large-Eddy Simulations (LES) of turbulent flows are fundamentally based on resolving eddy sizes larger than a filter width… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2014
Review
2014
Makoto Abe Masahiro Abe Taiji Adachi Ken-ichi Aihara Haruhiko Akiyama Toru Akune Norio Amizuka Kazuhiro Aoki Kiyoshi Aoyagi… (More)
Is this relevant?
2012
2012
Different types of fats have been utilized in an attempt to improve reproductive function in ruminant animals. Fatty acids… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
2011
2011
A stem rot, similar to that caused by Sclerotinia minor on sunflower (Helianthus annuus), was observed on the weed, Bathurst Burr… (More)
Is this relevant?
2010
2010
Cover cropping is increasingly being used as a form of sustainable soil management in grapevine (Vitis vinifera L.) production… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
2009
2009
In a seminal paper from 1983, Burr and Erd1⁄2os started the systematic study of Ramsey numbers of cliques vs. large sparse graphs… (More)
Is this relevant?
2005
2005
Many applications of Szemerédi’s Regularity Lemma for graphs are based on the following counting result. If G is an s-partite… (More)
  • figure 5.1
  • figure 9.1
Is this relevant?
2004
2003
2003
in the sense that, for each δ > 0, there is an integer nδ such that if n ≥ nδ one can select a set of coefficients Θ ⊂ Sn−1 of… (More)
Is this relevant?
2001
2001
  • Nikolaos Kidonakisa, Eri Laenenb, Sven Mo, Ramona Vogtd
  • 2001
 
Is this relevant?