Independent Transversals and Independent Coverings in Sparse Partite Graphs

DOI10.1017/S0963548396002763MaRDI QIDQ3123116zbMATH OpenOpenAlexWikidataFDO

Authors 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 coveringindependent transversal

Mathematics Subject Classification ID

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

Recommendations

• Independent Transversals in Sparse Partite Hypergraphs
• Independent transversals in locally sparse graphs
• Independent transversals in bipartite correspondence-covers
• Independent transversals in \(r\)-partite graphs

Cited in

(14)

• Independent transversals in \(r\)-partite graphs
• Independent transversals of hypergraph edges and bipartite bigraphs
• Independent coverings and orthogonal colourings
• Independent transversals in locally sparse graphs
• On factors of independent transversals in \(k\)-partite graphs
• An average degree condition for independent transversals
• Bounded transversals in multipartite graphs
• Independent Transversals in Sparse Partite Hypergraphs
• Finding independent transversals efficiently
• A general framework for hypergraph coloring
• An asymptotically sharp bound on the maximum number of independent transversals
• A precise condition for independent transversals in bipartite covers
• Polynomial treewidth forces a large grid-like-minor
• Approximate packing of independent transversals in locally sparse graphs

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

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