Generalizations and strengthenings of Ryser's conjecture

DOI10.37236/9914zbMath1486.05195arXiv2009.07239OpenAlexW4206408622WikidataQ113693631 ScholiaQ113693631MaRDI QIDQ2121724

Grace McCourt, Louis DeBiasio, Yigal Kamel, Hannah Sheats

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Transversal (matching) theory (05D15)

Related Items (1)

Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partition of graphs and hypergraphs into monochromatic connected parts
• Partitioning random graphs into monochromatic components
• Extremal hypergraphs for Ryser's conjecture
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning by monochromatic trees
• Maximum degree and fractional matchings in uniform hypergraphs
• Vertex coverings by monochromatic cycles and trees
• On the ratio of optimal integral and fractional covers
• Finding large \(p\)-colored diameter two subgraphs
• Monochromatic coverings and tree Ramsey numbers
• A family of extremal hypergraphs for Ryser's conjecture
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• Monochromatic trees in random graphs
• On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs
• Forcing large tight components in 3-graphs
• An observation concerning Ryser's conjecture
• Two combinatorial covering theorems
• Generalizing the Ramsey problem through diameter
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs
• Monochromatic partitions in local edge colorings
• Ryser's conjecture for \(t\)-intersecting hypergraphs
• Density of monochromatic infinite subgraphs
• A note on intersecting hypergraphs with large cover number
• Covering complete partite hypergraphs by monochromatic components
• Monochromatic tree covers and Ramsey numbers for set-coloured graphs
• Monochromatic components in edge-colored complete uniform hypergraphs
• Threshold and hitting time for high-order connectedness in random hypergraphs
• Large components in r-edge-colorings of Kn have diameter at most five
• Commuting contractive families
• Large Cross-Free Sets in Steiner Triple Systems
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• On Contractive Families and a Fixed‐Point Question of Stein
• Large Monochromatic Triple Stars in Edge Colourings
• Monochromatic Paths in Graphs
• Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs
• The size of the giant high‐order component in random hypergraphs
• Total Domination in Graphs
• Largest Components in Random Hypergraphs
• Covering complete graphs by monochromatically bounded sets
• Nonintersecting Ryser Hypergraphs
• Partitioning a graph into monochromatic connected subgraphs
• Multipartite hypergraphs achieving equality in Ryser's conjecture

This page was built for publication: Generalizations and strengthenings of Ryser's conjecture