Independent Transversals and Independent Coverings in Sparse Partite Graphs

DOI10.1017/S0963548396002763zbMath0882.05104OpenAlexW1990479896WikidataQ127332231 ScholiaQ127332231MaRDI QIDQ3123116

Raphael Yuster

Publication date: 6 March 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548396002763

zbMATH Keywords

boundsindependent transversalindependent covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

On factors of independent transversals in \(k\)-partite graphs ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ Polynomial treewidth forces a large grid-like-minor ⋮ Independent coverings and orthogonal colourings

This page was built for publication: Independent Transversals and Independent Coverings in Sparse Partite Graphs