On the maximum number of edges in hypergraphs with fixed matching and clique number
Authors:
- Peter FranklPFPeter Frankl
- Erica L.L. LiuELErica L.L. Liu
- Jian WangJWJian Wang
Open Access
- 11 July 2022
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 106
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On the maximum number of edges in a hypergraph with given matching numberDiscrete Applied Mathematics, 2017
- The Size of a Hypergraph and its Matching NumberCombinatorics, Probability and Computing, 2012
- An Erdős–Ko–Rado Theorem for Direct ProductsEuropean Journal of Combinatorics, 1996
- On the size of graphs with complete‐factorsJournal of Graph Theory, 1985
- The exact bound in the Erdös-Ko-Rado theoremCombinatorica, 1984
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPHThe Quarterly Journal of Mathematics, 1976
- A simple proof of the Erdös-Chao Ko-Rado theoremJournal of Combinatorial Theory, Series B, 1972
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1967
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959