A precise condition for independent transversals in bipartite covers

DOI10.1137/23M1600384zbMATH Open1540.05168MaRDI QIDQ6542538FDOQ6542538

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)

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded transversals in multipartite graphs
• A note on group colorings
• Independent systems of representatives in weighted graphs
• A condition for matchability in hypergraphs
• On Forming Committees
• The choice number of random bipartite graphs
• On complete subgraphs of \(r\)-chromatic graphs
• Extremal problems for transversals in graphs with bounded degree
• A note on vertex list colouring
• Asymmetric list sizes in bipartite graphs
• Title not available (Why is that?)
• Independent transversals in bipartite correspondence-covers
• Degree criteria and stability for independent transversals

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)