Covering random graphs with monochromatic trees

DOI10.1002/RSA.21120zbMath1525.05153arXiv2109.02569OpenAlexW4308750680MaRDI QIDQ6074874

Matija Bucić, Domagoj Bradač

Publication date: 19 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

thresholdsrandom graphshypergraphs

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 (1)

Large monochromatic components in colorings of complete hypergraphs

Cites Work

• 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 random graphs into monochromatic components
• Local constraints ensuring small representing sets
• Helly property in finite set systems
• Large monochromatic components and long monochromatic cycles in random hypergraphs
• Monochromatic trees in random graphs
• Transversals in uniform hypergraphs with property (7, 2)
• Transversals in uniform hypergraphs with property \((p,2)\)
• Small transversals in uniform hypergraphs
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs
• Monochromatic cycle covers in random graphs
• Monochromatic cycle partitions in random graphs
• Covering 3-Edge-Colored Random Graphs with Monochromatic Trees
• On generalized graphs

This page was built for publication: Covering random graphs with monochromatic trees