A precise condition for independent transversals in bipartite covers

DOI10.1137/23M1600384MaRDI QIDQ6542538zbMATH OpenFDO

Authors Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski

Publication date 22 May 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph coloringbipartite graphsindependent transversals

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Recommendations

• Independent transversals in bipartite correspondence-covers
• Independent Transversals and Independent Coverings in Sparse Partite Graphs
• An average degree condition for independent transversals
• Independent transversals in locally sparse graphs

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 1299964 (Why is no real title available?)
• A condition for matchability in hypergraphs
• A note on group colorings
• A note on vertex list colouring
• Asymmetric list sizes in bipartite graphs
• Bounded transversals in multipartite graphs
• Degree criteria and stability for independent transversals
• Extremal problems for transversals in graphs with bounded degree
• Independent systems of representatives in weighted graphs
• Independent transversals in bipartite correspondence-covers
• On Forming Committees
• On complete subgraphs of r-chromatic graphs
• The choice number of random bipartite graphs

Cited in

(1)

• Constructing graphs with no independent transversals

This page was built for publication: A precise condition for independent transversals in bipartite covers

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