A note on fractional disjoint transversals in hypergraphs

DOI10.1016/J.DISC.2017.05.001zbMATH Open1367.05150OpenAlexW2622099553MaRDI QIDQ2012518FDOQ2012518

Authors: Michael A. Henning, A. Yeo 

Publication date: 1 August 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.05.001

Recommendations

• Bounds on upper transversals in hypergraphs
• Hypergraphs with large transversal number
• On upper transversals in 3-uniform hypergraphs
• Transversal numbers of uniform hypergraphs
• Transversals in 4-uniform hypergraphs

zbMATH Keywords

transversalhypergraph3SAT

Mathematics Subject Classification ID

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

Cites Work

• Small transversals in hypergraphs
• Transversal numbers of uniform hypergraphs
• Title not available (Why is that?)
• Total domination of graphs and small transversals of hypergraphs
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• Strong transversals in hypergraphs and double total domination in graphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Transversals and domination in uniform hypergraphs
• Hypergraphs with large transversal number
• Linear hypergraphs with large transversal number and maximum degree two
• Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
• Total transversals and total domination in uniform hypergraphs
• Transversals in 4-uniform hypergraphs
• On coupon colorings of graphs
• Thoroughly dispersed colorings
• Density conditions for panchromatic colourings of hypergraphs

Cited In (2)

• Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
• Fractional domatic, idomatic, and total domatic numbers of a graph

This page was built for publication: A note on fractional disjoint transversals in hypergraphs

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