On hypergraphs of girth five.
Lazebnik, Felix, Verstraëte, Jacques (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lazebnik, Felix, Verstraëte, Jacques (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhu, Xuding (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu, Marciniszyn, Martin, Steger, Angelika (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pouria Salehi Nowbandegani, Hossein Esfandiari, Mohammad Hassan Shirdareh Haghighi, Khodakhast Bibak (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs
Vandenbussche, Jennifer, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Erdős, Paul (1995)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Jin, Zemin, Li, Xueliang (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ingo Schiermeyer (2005)
Discussiones Mathematicae Graph Theory
Similarity:
The cycle-complete graph Ramsey number r(Cₘ,Kₙ) is the smallest integer N such that every graph G of order N contains a cycle Cₘ on m vertices or has independence number α(G) ≥ n. It has been conjectured by Erdős, Faudree, Rousseau and Schelp that r(Cₘ,Kₙ) = (m-1)(n-1)+1 for all m ≥ n ≥ 3 (except r(C₃,K₃) = 6). This conjecture holds for 3 ≤ n ≤ 6. In this paper we will present a proof for r(C₅,K₇) = 25.
De Winter, Stefaan, Lazebnik, Felix, Verstraëte, Jacques (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caro, Yair, Yuster, Raphael (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rinaldi, Gloria, Traetta, Tommaso (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: