Matching criticality in intersecting hypergraphs
From MaRDI portal
Publication:5236049
DOI10.2989/16073606.2016.1260069zbMath1423.05110arXiv1512.02871OpenAlexW2963292227MaRDI QIDQ5236049
Zhenyu Ni, Erfang Shan, Li-ying Kang
Publication date: 15 October 2019
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02871
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with large transversal number and with edge sizes at least four
- Covers in partitioned intersecting hypergraphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- Transversals and matchings in 3-uniform hypergraphs
- A comment on Ryser's conjecture for intersecting hypergraphs
- Critical hypergraphs and interesting set-pair systems
- Finite projective spaces and intersecting hypergraphs
- Small transversals in hypergraphs
- On intersecting hypergraphs
- Matchings and covers in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- A condition for matchability in hypergraphs
- Most probably intersecting hypergraphs
- Linear hypergraphs with large transversal number and maximum degree two
- Matching critical intersection hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Hypergraphs with large transversal number and with edge sizes at least 3
- Matchings in hypergraphs of large minimum degree
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Matching criticality in intersecting hypergraphs
