Covering graphs by monochromatic trees and Helly-type results for hypergraphs

DOI10.1007/s00493-020-4292-9zbMath1488.05350arXiv1902.05055OpenAlexW3155051756MaRDI QIDQ2043761

Dániel Korándi, Benjamin Sudakov, Matija Bucić

Publication date: 3 August 2021

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

treecoveringhypergraphsHelly

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Generalizations and strengthenings of Ryser's conjecture ⋮ Covering random graphs with monochromatic trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• On Ryser's conjecture
• Partitioning random graphs into monochromatic components
• On Ryser's conjecture for linear intersecting multipartite hypergraphs
• Local constraints ensuring small representing sets
• An improved bound for the monochromatic cycle partition number
• Ryser's conjecture for tripartite 3-graphs
• An extremal problem for sets with applications to graph theory
• Vertex coverings by monochromatic cycles and trees
• On the ratio of optimal integral and fractional covers
• A family of extremal hypergraphs for Ryser's conjecture
• Large monochromatic components and long monochromatic cycles in random hypergraphs
• Matchings and covers in hypergraphs
• Transversals in uniform hypergraphs with property (7, 2)
• Transversals in uniform hypergraphs with property \((p,2)\)
• Small transversals in uniform hypergraphs
• Minimum degree conditions for monochromatic cycle partitioning
• Exact bounds for some hypergraph saturation problems
• A note on intersecting hypergraphs with large cover number
• τ–Critical Hypergraphs and the Helly Property
• Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs
• Monochromatic cycle covers in random graphs
• Monochromatic cycle partitions in random graphs
• Partitioning a graph into monochromatic connected subgraphs
• A Problem in Graph Theory
• On generalized graphs
• Multipartite hypergraphs achieving equality in Ryser's conjecture

This page was built for publication: Covering graphs by monochromatic trees and Helly-type results for hypergraphs