Monochromatic Hamiltonian 3‐tight Berge cycles in 2‐colored 4‐uniform hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Type: Article

Publication Date: 2009-05-11

Citations: 8

DOI: https://doi.org/10.1002/jgt.20427

Abstract

Abstract Here improving on our earlier results, we prove that there exists an n 0 such that for n ⩾ n 0 in every 2‐coloring of the edges of K there is a monochromatic Hamiltonian 3‐tight Berge cycle. This proves the c =2, t =3, r =4 special case of a conjecture from (P. Dorbec, S. Gravier, and G. N. Sárközy, J Graph Theory 59 (2008), 34–44). © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 288–299, 2010

Locations

Journal of Graph Theory - View
CiteSeer X (The Pennsylvania State University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Monochromatic Hamiltonian <i>t</i>‐tight Berge‐cycles in hypergraphs	2008	Paul Dorbec Sylvain Gravier Gábor N. Sárközy
+	Monochromatic Hamiltonian Berge-cycles in colored hypergraphs	2014	G.R. Omidi Leila Maherani
+	Monochromatic Hamiltonian Berge-cycles in colored hypergraphs	2016	Leila Maherani G.R. Omidi
+ PDF Chat	Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs	2010	András Gyárfás Gábor N. Sárközy Endre Szemerédi
+	Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs	2008	Sylvain Gravier Paul Dorbec Gábor N. Sárközy
+	A proof for a conjecture of Gyarfas, Lehel, Sarkozy and Schelp on Berge-cycles	2014	G.R. Omidi
+	Monochromatic paths in $2$-edge coloured graphs and hypergraphs	2022	Maya Stein
+ PDF Chat	A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles	2021	G.R. Omidi
+	Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs	2023	Maya Stein
+ PDF Chat	Monochromatic Path and Cycle Partitions in Hypergraphs	2013	András Gyárfás Gábor N. Sárközy
+ PDF Chat	On Ramsey numbers of 3-uniform Berge cycles	2024	Leila Maherani Maryam Shahsiah
+	Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle	2018	Colton Magnant Daniel M. Martin Pouria Salehi Nowbandegani
+	On Ramsey numbers of 3-uniform Berge cycles	2022	Leila Maherani Maryam Shahsiah
+ PDF Chat	Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs	2007	András Gyárfás Jenö Lehel Gábor N. Sárközy R. H. Schelp
+	A note on the Tur\'an number of a Berge odd cycle	2019	Dániel Gerbner
+	A note on the Turán number of a Berge odd cycle	2019	Dániel Gerbner
+ PDF Chat	Hamiltonian Paths and Cycles in Some 4-Uniform Hypergraphs	2022	Guanwu Liu Xiaonan Liu
+	Hamiltonian Cycles in Edge-Colored Graphs	2015	Yannis Manoussakis Raquel Díaz Raquel Águeda Leandro Montero
+	Hamiltonian paths and cycles in some 4-uniform hypergraphs	2021	Guanwu Liu Xiaonan Liu
+	Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles	2017	Sebastián Bustamante Hiệp Hàn Maya Stein

Works That Cite This (7)

Action	Title	Year	Authors
+	Monochromatic Hamiltonian Berge-cycles in colored hypergraphs	2016	Leila Maherani G.R. Omidi
+ PDF Chat	Colored complete hypergraphs containing no rainbow Berge triangles	2019	Colton Magnant
+	Monochromatic Partitions In Local Edge Colorings	2020	Gábor N. Sárközy
+ PDF Chat	Embedding Graphs into Larger Graphs: Results, Methods, and Problems	2019	Miklós Simonovits Endre Szemerédi
+ PDF Chat	Rainbow Hamilton Cycles in Uniform Hypergraphs	2012	Andrzej Dudek Alan Frieze Andrzej Ruciński
+	Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)	2010	Vojtěch Rödl Andrzej Ruciński
+ PDF Chat	Hamilton Saturated Hypergraphs of Essentially Minimum Size	2013	Andrzej Ruciński Andrzej Żak

Works Cited by This (7)

Action	Title	Year	Authors
+	Highly connected monochromatic subgraphs	2007	Béla Bollobás András Gyárfás
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey
+	A Dirac-Type Theorem for 3-Uniform Hypergraphs	2006	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+ PDF Chat	Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs	2007	András Gyárfás Jenö Lehel Gábor N. Sárközy R. H. Schelp
+	Graduate Texts in Mathematics	2020	J. H. van Lint
+	Three-Color Ramsey Numbers For Paths	2007	András Gyárfás Miklós Ruszinkó Gábor N. Sárközy Endre Szemerédi
+ PDF Chat	Monochromatic Hamiltonian <i>t</i>‐tight Berge‐cycles in hypergraphs	2008	Paul Dorbec Sylvain Gravier Gábor N. Sárközy