Large monochromatic components and long monochromatic cycles in random hypergraphs

DOI10.1016/j.ejc.2018.10.001zbMath1402.05190arXiv1709.02990OpenAlexW2963293152MaRDI QIDQ1633610

Andrzej Dudek, Sean English, Louis DeBiasio, Patrick Bennett

Publication date: 20 December 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.02990

zbMATH Keywords

Ramsey theoryRyser's conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Covering random graphs with monochromatic trees ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• The size Ramsey number of a directed path
• Partitioning random graphs into monochromatic components
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Covering \(t\)-element sets by partitions
• Generalizing the Ramsey problem through diameter
• Long cycles in subgraphs of (pseudo)random directed graphs
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Combinatorial theorems relative to a random set
• On some Multicolor Ramsey Properties of Random Graphs
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
• Path Ramsey Number for Random Graphs

This page was built for publication: Large monochromatic components and long monochromatic cycles in random hypergraphs