On the maximum number of edges in hypergraphs with fixed matching and clique number

被引：1
|
作者：
Frankl, Peter [1 ]
Liu, Erica L. L. [2 ,3 ]
Wang, Jian [4 ]
机构：
[1] Reny Inst Math, Realtanoda U 13-15, H-1053 Budapest, Hungary
[2] Tianjin Univ Technol & Educ, Sch Sci, Tianjin 300222, Peoples R China
[3] Tianjin Univ, Ctr Appl Math, Tianjin 300072, Peoples R China
[4] Taiyuan Univ Technol Taiyuan, Dept Math, Taiyuan 030024, Peoples R China
来源：
EUROPEAN JOURNAL OF COMBINATORICS | 2022年 / 106卷
基金：
中国国家自然科学基金;
关键词：
INTERSECTION-THEOREMS; SIZE; SYSTEMS;
D O I：
10.1016/j.ejc.2022.103589
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a k-graph F subset of ([n] ), the clique number of F is defined to be the maximum size of a subset Q of [n] with (Q k ) & SUB; F. In the present paper, we determine the maximum number of edges in a k-graph on [n] with matching number at most s and clique number at least q for n < 8k2s and for q > (s + 1)k - l, n & LE; (s + 1)k + s/(3k) - l. Two special cases that q = (s + 1)k - 2 and k = 2 are solved completely. (c) 2022 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页数：24
相关论文
共 50 条
  • [21] Lower Bounds for the Number of Edges in Hypergraphs of Certain Classes
    Shabanov, D. A.
    DOKLADY MATHEMATICS, 2010, 82 (02) : 705 - 708
  • [22] A note on the minimum number of edges in hypergraphs with property O
    Kronenberg, Gal
    Kusch, Christopher
    Lamaison, Ander
    Micek, Piotr
    Tran, Tuan
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 81 : 172 - 177
  • [23] The Minimum Number of Edges in Uniform Hypergraphs with Property O
    Duffus, Dwight
    Kay, Bill
    Rodl, Vojtech
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (04): : 531 - 538
  • [24] SIMPLE HYPERGRAPHS WITH MAXIMAL NUMBER OF ADJACENT PAIRS OF EDGES
    AHLSWEDE, R
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1980, 28 (02) : 164 - 167
  • [25] On the Number of Edges in Colour-Critical Graphs and Hypergraphs
    A. V. Kostochka
    M. Stiebitz
    Combinatorica, 2000, 20 : 521 - 530
  • [26] Lower bounds for the number of edges in hypergraphs of certain classes
    D. A. Shabanov
    Doklady Mathematics, 2010, 82 : 705 - 708
  • [27] On the number of edges in colour-critical graphs and hypergraphs
    Kostochka, AV
    Stiebitz, M
    COMBINATORICA, 2000, 20 (04) : 521 - 530
  • [28] On the number of edges in hypergraphs critical with respect to strong colourings
    Kostochka, AV
    Woodall, DR
    EUROPEAN JOURNAL OF COMBINATORICS, 2000, 21 (02) : 249 - 255
  • [29] On Bounding the Difference of the Maximum Degree and the Clique Number
    Schaudt, Oliver
    Weil, Vera
    GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1689 - 1702
  • [30] On Bounding the Difference of the Maximum Degree and the Clique Number
    Oliver Schaudt
    Vera Weil
    Graphs and Combinatorics, 2015, 31 : 1689 - 1702
12345