Core Concepts
Balanceable and simply balanceable regular graphs are characterized based on the independence number, leading to different recognition complexities for various degrees.
Abstract
Introduction
Definition of balanceable graphs by Caro et al.
Previous work on balanceable graphs and their properties.
Balanceable Graphs
Definition and characterization of balanceable graphs.
Challenges in determining balanceability.
Simply Balanceable Graphs
Definition and characterization of simply balanceable graphs.
Equivalence of conditions for simple balanceability.
Results
Characterization of simply balanceable regular graphs.
NP-completeness proof for recognizing simply balanceable 9-regular graphs.
Balanceability of cubic graphs.
Balanceability of 4-regular graphs.
Conclusion
Summary of results and open questions.
Stats
Let G be a graph and n be a positive integer. Let bal(n, G) < ⌊1/2 n^2⌋ be the smallest integer, if it exists, such that every 2-coloring ϕ: E(Kn) → {R, B} of the edges of the complete graph Kn with ϕ−1(R) > bal(n, G) contains a balanced copy of G.
Every cubic graph is balanceable.
Every 4-regular graph of order n, where n ≡ 0 (mod 4), is balanceable.
Quotes
"A graph G is simply balanceable if there exists an independent set I in G such that |E|/2 = ∑_{x∈I} d(x)."
"Determining whether a given 9-regular graph is simply balanceable is NP-complete."