Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
Authors:
- András GyárfásAGAndrás Gyárfás
- Jenő LehelJLJenő Lehel
- Gábor N. SárközyGSGábor N. Sárközy
- R.H. SchelpRSR.H. Schelp
- 1 March 2008
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 98 (2) , 342-358
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Ramsey number for a triple of long even cyclesJournal of Combinatorial Theory, Series B, 2007
- Tripartite Ramsey numbers for pathsJournal of Graph Theory, 2007
- Three-Color Ramsey Numbers For PathsCombinatorica, 2007
- An improved bound for the monochromatic cycle partition numberJournal of Combinatorial Theory, Series B, 2006
- The Ramsey number for hypergraph cycles IJournal of Combinatorial Theory, Series A, 2006
- R(Cn,Cn,Cn)⩽(4+o(1))nJournal of Combinatorial Theory, Series B, 1999
- An algorithmic version of the blow-up lemmaRandom Structures & Algorithms, 1998
- Blow-up LemmaCombinatorica, 1997
- The Uniformity Lemma for hypergraphsGraphs and Combinatorics, 1992
- Regularity lemmas for hypergraphs and quasi‐randomnessRandom Structures & Algorithms, 1991