Independent Transversals in Sparse Partite Hypergraphs

DOI10.1017/S0963548300001206MaRDI QIDQ4314148zbMATH OpenOpenAlexWikidataFDO

Authors András Gyárfás, Tomasz Łuczak, P. Erdős

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

affine planehypergraphicsindependent transversalprobabilistic methodsparse partite hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• Independent transversals in \(r\)-partite graphs
• Independent Transversals and Independent Coverings in Sparse Partite Graphs
• On independent sets in hypergraphs
• Independent transversals in locally sparse graphs
• An average degree condition for independent transversals

Cites work

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

Cited in

(16)

• 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
• Partitioning of loop-free sperner hypergraphs into transversals
• Independent Transversals and Independent Coverings in Sparse Partite Graphs
• Odd Independent Transversals are Odd
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Partition-crossing hypergraphs
• A general framework for hypergraph coloring
• Independent transversals in bipartite correspondence-covers
• Colorings, transversals, and local sparsity
• Asymmetric list sizes in bipartite graphs
• Smallest set-transversals of \(k\)-partitions

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

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