Covering numbers for graphs and hypergraphs
Bela Bollobas, Alexander Scott
TL;DR
This paper discusses covering numbers in graphs and hypergraphs, providing theoretical insights into their properties and bounds.
Contribution
It introduces new bounds and methods for analyzing covering numbers in graphs and hypergraphs, enhancing understanding of their combinatorial complexity.
Findings
Derived new bounds for covering numbers
Established relationships between covering numbers and graph properties
Provided theoretical tools for hypergraph analysis
Abstract
This paper has been withdrawn, as it has been merged into arXiv:1009.6144
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Advanced Graph Theory Research