Large monochromatic components and long monochromatic cycles in random hypergraphs

DOI10.1016/J.EJC.2018.10.001MaRDI QIDQ1633610zbMATH OpenOpenAlexFDO

Authors Patrick Bennett, Louis DeBiasio, Andrzej Dudek, Sean English

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) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Hypergraphs (05C65)

Abstract: We extend results of Gy'arf'as and F"uredi on the largest monochromatic component in $r$-colored complete $k$-uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in $r$-colored random hypergraphs. In particular, we obtain a random analog of a result of Gy'arf'as, S'ark"ozy, and Szemer'edi on the longest monochromatic loose cycle in $2$-colored complete $k$-uniform hypergraphs.

Recommendations

• Improved monochromatic loose cycle partitions in hypergraphs
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Monochromatic cycle partitions in random graphs
• Monochromatic loose-cycle partitions in hypergraphs
• Partitioning random graphs into monochromatic components

Cites work

• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• An alternative proof of the linearity of the size-Ramsey number of paths
• Combinatorial theorems relative to a random set
• Covering \(t\)-element sets by partitions
• Generalizing the Ramsey problem through diameter
• Highly connected monochromatic subgraphs of multicolored graphs
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Long cycles in subgraphs of (pseudo)random directed graphs
• Maximum degree and fractional matchings in uniform hypergraphs
• On some multicolor Ramsey properties of random graphs
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning random graphs into monochromatic components
• Path Ramsey number for random graphs
• Szemerédi's regularity Lemma for matrices and sparse graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• The size Ramsey number of a directed path

Cited in

(8)

• Large monochromatic components in colorings of complete hypergraphs
• Large monochromatic components in 3‐edge‐colored Steiner triple systems
• Monochromatic cycle covers in random graphs
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Large monochromatic components in expansive hypergraphs
• Covering random graphs with monochromatic trees
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs
• Bounded monochromatic components for random graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633610)