Large monochromatic components in 3‐edge‐colored Steiner triple systems

DOI10.1002/jcd.21707arXiv1908.00837OpenAlexW3007046782MaRDI QIDQ6187431

Louis DeBiasio, Michael Tait

Publication date: 31 January 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

Steiner triple systemRamsey problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex degrees (05C07)

Related Items

Large monochromatic components in colorings of complete hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number for hypergraph cycles. I.
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Covering \(t\)-element sets by partitions
• Bicoloring Steiner triple systems
• Large monochromatic components and long monochromatic cycles in random hypergraphs
• The minimum independence number for designs
• Density of monochromatic infinite subgraphs
• Discrepancy of high-dimensional permutations
• Large Cross-Free Sets in Steiner Triple Systems
• Almost all Steiner triple systems have perfect matchings
• The Chromatic Number of Kneser Hypergraphs
• On uncrowded hypergraphs
• On the Independence Number of Steiner Systems
• Almost all Steiner triple systems are almost resolvable
• On the Method of Typical Bounded Differences
• On independent sets in hypergraphs