Abstract
AbstractA conjecture of Chung and Graham states that every ‐free graph on vertices contains a vertex set of size that spans at most edges. We make the first step toward this conjecture by showing that it holds for all regular graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
