Affine planes and transversals in 3-uniform linear hypergraphs
From MaRDI portal
Publication:2045381
DOI10.1007/S00373-021-02285-XzbMATH Open1470.05066OpenAlexW3139210006MaRDI QIDQ2045381FDOQ2045381
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
Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Transversal (matching) theory (05D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Transversal numbers of uniform hypergraphs
- Some remarks on domination
- Total Domination in Graphs
- Total domination of graphs and small transversals of hypergraphs
- An upper bound for the transversal numbers of 4-uniform 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
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Hypergraphs with large transversal number
- Linear hypergraphs with large transversal number and maximum degree two
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Total domination in partitioned graphs
- A global parallel algorithm for the hypergraph transversal problem
- Transversals in linear uniform hypergraphs
- Computing and Combinatorics
- Upper transversals in hypergraphs
- On upper transversals in 3-uniform hypergraphs
Cited In (1)
This page was built for publication: Affine planes and transversals in 3-uniform linear hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045381)
