Independent transversals in \(r\)-partite graphs

DOI10.1016/S0012-365X(96)00300-7zbMath0891.05041MaRDI QIDQ1377695

Raphael Yuster

Publication date: 6 July 1998

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

zbMATH Keywords

independent transversal\(r\)-partite graphs

Mathematics Subject Classification ID

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

Related Items (20)

Bounded transversals in multipartite graphs ⋮ The Density Turán Problem ⋮ Independent transversals in locally sparse graphs ⋮ On factors of independent transversals in \(k\)-partite graphs ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ On a conjecture of Stein ⋮ Graphs of low average degree without independent transversals ⋮ Bounded size components -- partitions and transversals. ⋮ Fair Representation by Independent Sets ⋮ The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm ⋮ Problems and results in extremal combinatorics. I. ⋮ Polynomial treewidth forces a large grid-like-minor ⋮ Independent systems of representatives in weighted graphs ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ Finding independent transversals efficiently ⋮ The intersection of a matroid and a simplicial complex ⋮ Asymptotically the list colouring constants are 1 ⋮ Cooperative colorings and independent systems of representatives

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs and matching theorems
• On complete subgraphs of \(r\)-chromatic graphs
• An algorithmic approach to the Lovász local lemma. I
• The strong chromatic number of a graph

This page was built for publication: Independent transversals in \(r\)-partite graphs