Minimal normal graph covers
David Gajser, Bojan Mohar

TL;DR
This paper studies the properties of normal graph covers, establishing bounds on clique and stable set sizes relative to the number of vertices, and constructs extremal examples demonstrating these bounds.
Contribution
It introduces extremal bounds for normal covers with bounded clique and stable set sizes and constructs graphs achieving near these bounds.
Findings
For graphs with normal covers, c+s ≥ log₂(n).
Constructed graphs with clique and stable set sizes less than 0.87 log₂(n).
Existence of normal graphs with Θ(log₂(n)) clique and independence numbers.
Abstract
A graph is normal if it admits a clique cover and a stable set cover such that each clique in and each stable set in have a vertex in common. The pair is a normal cover of the graph. We present the following extremal property of normal covers. For positive integers , if a graph with vertices admits a normal cover with cliques of sizes at most and stable sets of sizes at most , then . For infinitely many , we also give a construction of a graph with vertices that admits a normal cover with cliques and stable sets of sizes less than . Furthermore, we show that for all , there exists a normal graph with vertices, clique number and independence number . When or are very small, we can describe all normal graphs…
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.
