Affine planes and transversals in 3-uniform linear hypergraphs
From MaRDI portal
Publication:2045381
Recommendations
Cites work
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- A global parallel algorithm for the hypergraph transversal problem
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Computing and Combinatorics
- Coupon collecting and transversals of hypergraphs
- Covering all cliques of a graph
- Hypergraphs with large transversal number
- Hypergraphs with large transversal number and with edge sizes at least 3
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Linear hypergraphs with large transversal number and maximum degree two
- Minimum size transversals in uniform hypergraphs
- On upper transversals in 3-uniform hypergraphs
- Small transversals in hypergraphs
- Some remarks on domination
- Strong transversals in hypergraphs and double total domination in graphs
- Total domination in graphs
- Total domination in partitioned graphs
- Total domination of graphs and small transversals of hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- Transversals in linear uniform hypergraphs
- Upper transversals in hypergraphs
Cited in
(4)- An upper bound for the transversal number of connected \(k\)-uniform hypergraphs
- Strong transversals in hypergraphs and double total domination in graphs
- Transversals in 6-uniform hypergraphs and total domination in graphs with minimum degree six
- Total transversals in hypergraphs and their applications
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)
