Sparse sets in the complements of graphs with given girth

DOI10.1016/S0012-365X(00)00235-1zbMATH Open0983.05065OpenAlexW2160572888MaRDI QIDQ5936026

Douglas R. Woodall, Alexandr Kostochka

Publication date: 16 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00235-1

zbMATH Keywords

chromatic numbergirthcliquesparse set of edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Highly sparse sets as additive complements for a prescribed density ⋮ Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs ⋮ Highly spare sets as additive complements for a prescribed density: an open problem

This page was built for publication: Sparse sets in the complements of graphs with given girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936026)