Frankl, Péter (2018) Resilient Hypergraphs with Fixed Matching Number. COMBINATORICA, 38 (5). pp. 1079-1094. ISSN 0209-9683
![[img]](http://real.mtak.hu/style/images/fileicons/text.png) |
Text
Frankl2018_Article_ResilientHypergraphsWithFixedM.pdf Restricted to Registered users only Download (455kB) |
Official URL: https://doi.org/10.1007/s00493-016-3579-3
Abstract
Let H be a hypergraph of rank k, that is, |H| k for all H H. Let (H) denote the matching number, the maximum number of pairwise disjoint edges in H. For a vertex x let H(x) be the hypergraph consisting of the edges H H with x ? H. If (H(x)) = (H) for all vertices, H is called resilient. The main result is the complete determination of the maximum number of 2-element sets in a resilient hypergraph with matching number s. For k=3 it is The results are used to obtain a stability theorem for k-uniform hypergraphs with given matching number.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | SYSTEMS; THEOREMS; UNIFORM INTERSECTING FAMILIES; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 16 Jan 2019 13:39 |
| Last Modified: | 16 Jan 2019 13:39 |
| URI: | http://real.mtak.hu/id/eprint/90030 |
Actions (login required)
 |
Edit Item |
