Covering a hypergraph of subgraphs

DOI10.1016/S0012-365X(02)00427-2MaRDI QIDQ1850010zbMATH OpenFDO

Authors Noga Alon

Publication date 2 December 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bounding the vertex cover number of a hypergraph
• On the tree cover number of a graph
• KKM -- a topological approach for trees
• A tree version of Kőnig's theorem
• Covering non-uniform hypergraphs

Cited in

(17)

• Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph
• The (p, q) property in families of d-intervals and d-trees
• Piercing numbers in approval voting
• Quadratic forms on graphs
• Erdös-Pósa Property of Obstructions to Interval Graphs
• Red-blue clique partitions and (1-1)-transversals
• Using Brouwer’s Fixed Point Theorem
• Packing and covering with balls on Busemann surfaces
• Overlaying a hypergraph with a graph with bounded maximum degree
• scientific article; zbMATH DE number 3972916 (Why is no real title available?)
• Partial covering of hypergraphs
• Erdős–Pósa property of obstructions to interval graphs
• scientific article; zbMATH DE number 3887743 (Why is no real title available?)
• Recent techniques and results on the Erdős-Pósa property
• KKM -- a topological approach for trees
• Fractional covers and matchings in families of weighted \(d\)-intervals
• A tree version of Kőnig's theorem

This page was built for publication: Covering a hypergraph of subgraphs

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