High girth and extendability

DOI10.1016/0012-365X(95)00039-YzbMath0854.05085OpenAlexW2042259817WikidataQ126422465 ScholiaQ126422465MaRDI QIDQ1918540

Jaroslav Nešetřil, Pavol Gvozdjak

Publication date: 13 January 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00039-y

zbMATH Keywords

extendabilitygirthgenusperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• A hypergraph-free construction of highly chromatic graphs without short cycles
• The matching extendability of surfaces
• Extending subpermutation matrices in regular classes of matrices
• Ramanujan graphs
• On n-extendable graphs
• Explicit constructions of graphs without short cycles and low density codes
• Extending partial systems of distinct representatives
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On chromatic number of finite set-systems

This page was built for publication: High girth and extendability