Affine planes and transversals in 3-uniform linear hypergraphs
From MaRDI portal
Publication:2045381
DOI10.1007/s00373-021-02285-xzbMath1470.05066OpenAlexW3139210006MaRDI QIDQ2045381
Michael A. Henning, Anders Yeo
Publication date: 12 August 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02285-x
Hypergraphs (05C65) Transversal (matching) theory (05D15) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- A global parallel algorithm for the hypergraph transversal problem
- Total domination of graphs and small transversals of hypergraphs
- Total domination in partitioned graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- On upper transversals in 3-uniform hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Hypergraphs with large transversal number
- Transversals in linear uniform hypergraphs
- Upper transversals in hypergraphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Linear hypergraphs with large transversal number and maximum degree two
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Some remarks on domination
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Total Domination in Graphs
- Computing and Combinatorics
- Unnamed Item
- Unnamed Item
This page was built for publication: Affine planes and transversals in 3-uniform linear hypergraphs
