Independent Transversals in Sparse Partite Hypergraphs

DOI10.1017/S0963548300001206zbMath0811.05068OpenAlexW2090326703WikidataQ105824967 ScholiaQ105824967MaRDI QIDQ4314148

András Gyárfás, Tomasz Łuczak

Publication date: 7 December 1994

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

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

zbMATH Keywords

probabilistic methodaffine planeindependent transversalhypergraphicssparse partite hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15)

Related Items (7)

Asymmetric list sizes in bipartite graphs ⋮ Independent transversals in bipartite correspondence-covers ⋮ On factors of independent transversals in \(k\)-partite graphs ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ Colorings, transversals, and local sparsity ⋮ Independent coverings and orthogonal colourings

Cites Work

• A short proof of the existence of highly chromatic hypergraphs without short cycles

This page was built for publication: Independent Transversals in Sparse Partite Hypergraphs