The size of $3$-uniform hypergraphs with given matching number and codegree
Combinatorics
2017-09-22 v1
Abstract
Determine the size of -graphs with given graph parameters is an interesting problem. Chv\'atal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restricted maximum degree and matching number; Khare (DM, 2014) studied the same problem for linear -graphs with restricted matching number and maximum degree. In this paper, we give a tight upper bound of the size of -graphs with bounded codegree and matching number.
Keywords
Cite
@article{arxiv.1709.07208,
title = {The size of $3$-uniform hypergraphs with given matching number and codegree},
author = {Xinmin Hou and Lei Yu and Jun Gao and Boyuan Liu},
journal= {arXiv preprint arXiv:1709.07208},
year = {2017}
}
Comments
16 pages