Connectivity Graph-Codes
Noga Alon

TL;DR
This paper introduces the concept of connectivity codes in graphs, characterizes their maximum size, and explores when this maximum is achieved in certain regular expanders.
Contribution
It defines connectivity codes, establishes an upper bound on their size, and identifies conditions under which this bound is tight, especially in regular expanders.
Findings
Maximum size of connectivity codes is at most 2^{edge-connectivity}
Equality holds for certain regular expanders
Equality does not hold for some common graph classes
Abstract
The symmetric difference of two graphs on the same set of vertices is the graph on whose set of edges are all edges that belong to exactly one of the two graphs . For a fixed graph call a collection of spanning subgraphs of a connectivity code for if the symmetric difference of any two distinct subgraphs in is a connected spanning subgraph of . It is easy to see that the maximum possible cardinality of such a collection is at most , where is the edge-connectivity of and is its minimum degree. We show that equality holds for any -regular (mild) expander, and observe that equality does not hold in several natural examples including any large cubic graph, the square of a long cycle and products of a small clique with a long cycle.
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.
