Resilient Hypergraphs with Fixed Matching Number

被引:0
|
作者
Peter Frankl
机构
[1] Alfréd Rényi Institute,
来源
Combinatorica | 2018年 / 38卷
关键词
05D05; 05C65;
D O I
暂无
中图分类号
学科分类号
摘要
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 (2s+12)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( {\begin{array}{*{20}c} {2s + 1} \\ 2 \\ \end{array} } \right)$$\end{document} while for k ≧ 4 the formula is k⋅(2s+12)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k \cdot \left( {\begin{array}{*{20}c} {2s + 1} \\ 2 \\ \end{array} } \right)$$\end{document}. The results are used to obtain a stability theorem for k-uniform hypergraphs with given matching number.
引用
收藏
页码:1079 / 1094
页数:15
相关论文
共 50 条
  • [31] Hypergraphs with large transversal number
    Henning, Michael A.
    Yeo, Anders
    DISCRETE MATHEMATICS, 2013, 313 (08) : 959 - 966
  • [32] Testing the independence number of hypergraphs
    Langberg, M
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 405 - 416
  • [33] Circular chromatic number of hypergraphs
    Eslahchi, C
    Rafiey, A
    ARS COMBINATORIA, 2004, 73 : 239 - 246
  • [34] Matching in 3-uniform hypergraphs
    Zhang, Yi
    Lu, Mei
    DISCRETE MATHEMATICS, 2019, 342 (06) : 1731 - 1737
  • [35] Planted matching problems on random hypergraphs
    Adomaityte, Urte
    Toshniwal, Anshul
    Sicuro, Gabriele
    Zdeborova, Lenka
    PHYSICAL REVIEW E, 2022, 106 (05)
  • [36] Ordering Trees with Fixed Order and Matching Number by Laplacian Spectral Radius
    Shang Wang TAN College of Mathematics and Computational Science
    Journal of Mathematical Research with Applications, 2011, (03) : 381 - 392
  • [37] Ordering Trees with Fixed Order and Matching Number by Laplacian Spectral Radius
    Shang Wang TAN College of Mathematics and Computational ScienceChina University of PetroleumShandong PRChina
    数学研究与评论, 2011, 31 (03) : 381 - 392
  • [38] ON THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF UNICYCLIC GRAPHS WITH FIXED MATCHING NUMBER
    Zhang, Jing-Ming
    Huang, Ting-Zhu
    Guo, Ji-Ming
    PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD, 2015, 97 (111): : 187 - 197
  • [39] The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
    Li, Yanjia
    Spirkl, Sophie
    DISCRETE MATHEMATICS, 2023, 346 (04)
  • [40] Hypergraphs induced by algebras of fixed type
    Pioro, Konrad
    DISCRETE MATHEMATICS, 2011, 311 (16) : 1735 - 1753