Abstract
We relate the notions of arrangeability and admissibility to bounded expansion classes and prove that these notions can be characterized by ∇ 1 ( G ) . (The Burr–Erdős conjecture relates to ∇ 0 ( G ) .) This implies the linearity of the Ramsey number and the bounded game chromatic number for some new classes of graphs.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
