Abstract
In 1999, De Simone and Körner conjectured that every graph without induced C5,C7,C¯7 contains a clique cover C and a stable set cover I such that every clique in C and every stable set in I have a vertex in common. This conjecture has roots in information theory and became known as the Normal Graph Conjecture. Here we prove that all C4-free graphs of bounded maximum degree and sufficiently large odd girth (linear in the maximum degree) are normal. This is used to prove that for every fixed d, random d-regular graphs are a.a.s. normal.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
