### Abstract

The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge. We say that a subset of vertices is j-independent if its intersection with any edge has size strictly less than j. The Kruskal-Katona theorem implies that in an r-uniform hypergraph with a fixed size and order, the hypergraph with the most r-independent sets is the lexicographic hypergraph. In this paper, we use a hypergraph regularity lemma, along with a technique developed by Loh, Pikhurko and Sudakov, to give an asymptotically best possible upper bound on the number of j-independent sets in an r-uniform hypergraph.

Original language | English |
---|---|

Pages (from-to) | 9-20 |

Number of pages | 12 |

Journal | Combinatorics Probability and Computing |

Volume | 22 |

Issue number | 1 |

DOIs | |

State | Published - 1 Jan 2013 |

### Fingerprint

### Cite this

*Combinatorics Probability and Computing*,

*22*(1), 9-20. https://doi.org/10.1017/S0963548312000454

}

*Combinatorics Probability and Computing*, vol. 22, no. 1, pp. 9-20. https://doi.org/10.1017/S0963548312000454

**Hypergraph independent sets.** / Cutler, Jonathan; Radcliffe, A. J.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

T1 - Hypergraph independent sets

AU - Cutler, Jonathan

AU - Radcliffe, A. J.

PY - 2013/1/1

Y1 - 2013/1/1

N2 - The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge. We say that a subset of vertices is j-independent if its intersection with any edge has size strictly less than j. The Kruskal-Katona theorem implies that in an r-uniform hypergraph with a fixed size and order, the hypergraph with the most r-independent sets is the lexicographic hypergraph. In this paper, we use a hypergraph regularity lemma, along with a technique developed by Loh, Pikhurko and Sudakov, to give an asymptotically best possible upper bound on the number of j-independent sets in an r-uniform hypergraph.

AB - The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge. We say that a subset of vertices is j-independent if its intersection with any edge has size strictly less than j. The Kruskal-Katona theorem implies that in an r-uniform hypergraph with a fixed size and order, the hypergraph with the most r-independent sets is the lexicographic hypergraph. In this paper, we use a hypergraph regularity lemma, along with a technique developed by Loh, Pikhurko and Sudakov, to give an asymptotically best possible upper bound on the number of j-independent sets in an r-uniform hypergraph.

UR - http://www.scopus.com/inward/record.url?scp=84870920550&partnerID=8YFLogxK

U2 - 10.1017/S0963548312000454

DO - 10.1017/S0963548312000454

M3 - Article

VL - 22

SP - 9

EP - 20

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 1

ER -