The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
DOI10.1007/s00373-018-1921-9zbMath1402.05160OpenAlexW2866110250MaRDI QIDQ1756039
Yanxia Dong, Erfang Shan, Shan Li, Li-ying Kang
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1921-9
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) General theory of linear incidence geometry and projective geometries (51A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with large transversal number and with edge sizes at least four
- On Ryser's conjecture
- Hypergraphs with large domination number and with edge sizes at least three
- Covers in partitioned intersecting hypergraphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
- Ryser's conjecture for tripartite 3-graphs
- A comment on Ryser's conjecture for intersecting hypergraphs
- Finite projective spaces and intersecting hypergraphs
- Small transversals in hypergraphs
- A note on a conjecture of Ryser
- On intersecting hypergraphs
- A geometrical picture book
- Domination in intersecting hypergraphs
- Extremal hypergraphs for matching number and domination number
- Matchings and covers in hypergraphs
- Transversal numbers of uniform hypergraphs
- Star-uniform graphs
- Most probably intersecting hypergraphs
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Linear hypergraphs with large transversal number and maximum degree two
- Equality of domination and transversal numbers in hypergraphs
- Domination in hypergraphs
- Matching critical intersection hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- The Search for a Finite Projective Plane of Order 10
- Total Domination in Graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
