We consider the minimum number of edges in a k-edge-connected graph of order n with chromatic number at least c, obtaining the optimal bounds in most cases.
机构:
Department of Pure Mathematics and Mathematical Statistics (DPMMS), University of Cambridge, Wilberforce Road, Cambridge,CB3 0WA, United KingdomDepartment of Pure Mathematics and Mathematical Statistics (DPMMS), University of Cambridge, Wilberforce Road, Cambridge,CB3 0WA, United Kingdom
机构:
Univ Cambridge, Dept Pure Math & Math Stat DPMMS, Wilberforce Rd, Cambridge CB3 0WA, EnglandUniv Cambridge, Dept Pure Math & Math Stat DPMMS, Wilberforce Rd, Cambridge CB3 0WA, England