# Hypergraph Turán Problems

@inproceedings{Keevash2011HypergraphTP, title={Hypergraph Tur{\'a}n Problems}, author={Peter Keevash}, year={2011} }

One of the earliest results in Combinatorics is Mantel’s theorem from 1907 that the largest triangle-free graph on a given vertex set is complete bipartite. However, a seemingly similar question posed by Turán in 1941 is still open: what is the largest 3-uniform hypergraph on a given vertex set with no tetrahedron? This question can be considered a test case for the general hypergraph Turán problem, where given an r-uniform hypergraph F , we want to determine the maximum number of edges in an r… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 135 CITATIONS

## Edge-colorings of graphs avoiding complete graphs with a prescribed coloring

VIEW 4 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## New Short Proofs to Some Stability Theorems

VIEW 5 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Continuous optimisation in extremal combinatorics

VIEW 8 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Edges not in any monochromatic copy of a fixed graph

VIEW 5 EXCERPTS

CITES RESULTS

HIGHLY INFLUENCED

## Lagrangians of hypergraphs: The Frankl-Füredi conjecture holds almost everywhere

VIEW 5 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A rainbow Erdős-Rothschild problem

VIEW 7 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians

VIEW 11 EXCERPTS

CITES RESULTS & BACKGROUND

HIGHLY INFLUENCED

## An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree

VIEW 5 EXCERPTS

HIGHLY INFLUENCED

## Thresholds in probabilistic and extremal combinatorics

VIEW 8 EXCERPTS

CITES RESULTS, BACKGROUND & METHODS

HIGHLY INFLUENCED

### FILTER CITATIONS BY YEAR

### CITATION STATISTICS

**20**Highly Influenced Citations**Averaged 23 Citations**per year from 2017 through 2019

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 171 REFERENCES

## On 3-Hypergraphs with Forbidden 4-Vertex Configurations

VIEW 14 EXCERPTS

HIGHLY INFLUENTIAL

## Chromatic Turan problems and a new upper bound for K 4

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## An extended Euler-Poincaré theorem

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## A new generalization of the Erdős-Ko-Rado theorem

VIEW 18 EXCERPTS

HIGHLY INFLUENTIAL

## Extremal Graphs and Multigraphs with Two Weighted Colours

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## On the Fon-Der-Flaass interpretation of extremal examples for Turán’s (3, 4)-problem

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Vertex Turán problems in the hypercube

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## An Exact Result for Hypergraphs and Upper Bounds for the Tur[a-acute]n Density of Krr+1

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## On the density of 2-colorable 3-graphs in which any four points span at most two edges

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL