Fetching the paper…
Reading the bibliography…
Numerous problems in extremal hypergraph theory ask to determine the maximal size of a $k$-uniform hypergraph on $n$ vertices that does not contain an `enlarged' copy $H^+$ of a fixed hypergraph $H$.
On an extremal problem in graph theory (in Hungarian)
Pál Turán · 1941
Earlier work this paper cites.
On the structure of linear graphs
Paul Erdős and Arthur H. Stone · 1946
Earlier work this paper cites.
On certain sets of integers
Klaus Roth · 1953
Earlier work this paper cites.
On maximal paths and circuits of graphs
Paul Erdős and Tibor Gallai · 1959
Earlier work this paper cites.
Intersection theorems for systems of finite sets
Paul Erdős, Chao Ko, and Richard Rado · 1961
Earlier work this paper cites.
A problem on independent r-tuples
Paul Erdős · 1965
Earlier work this paper cites.
A limit theorem in graph theory
Paul Erdős and Miklos Simonovits · 1966
Earlier work this paper cites.
Some intersection theorems for systems of finite sets
Anthony J. W. Hilton and Eric C. Milner · 1967
Earlier work this paper cites.
A method for solving extremal problems in graph theory, stability problems
Miklós Simonovits · 1968
Earlier work this paper cites.
Étude des coefficients de Fourier des fonctions de l p ( g ) l^{p}(g)
Aline Bonami · 1970
Earlier work this paper cites.
Topics in combinatorial analysis
Paul Erdős · 1971
Earlier work this paper cites.
An extremal set-intersection theorem
Vašek Chvátal · 1974
Earlier work this paper cites.
Probabilistic characteristics of graphs with large connectivity
Grigory Margulis · 1974
Earlier work this paper cites.
Inequalities in Fourier analysis
William Beckner · 1975
Earlier work this paper cites.
Problems and results in graph theory and combinatorial analysis
Paul Erdős · 1975
Earlier work this paper cites.
Logarithmic sobolev inequalities
Leonard Gross · 1975
Earlier work this paper cites.
Integer sets containing no k elements in arithmetic progression
Endre Szemerédi · 1975
Earlier work this paper cites.
On Sperner families satisfying an additional condition
Péter Frankl · 1976
Earlier work this paper cites.
Contributions to the geometry of hamming spaces
Rudolf Ahlswede and Gyula O. H. Katona · 1977
Earlier work this paper cites.
On a conjecture of Chvátal on m-intersecting hypergraphs
J. C. Bermond and P. Frankl · 1977
Earlier work this paper cites.
A constructive lower bound for some Ramsey numbers
Péter Frankl · 1977
Earlier work this paper cites.
On families of finite sets no two of which intersect in a singleton
Péter Frankl · 1977
Earlier work this paper cites.
Intersection properties of systems of finite sets
Michel Deza, Paul Erdős, and Péter Frankl · 1978
Earlier work this paper cites.
The Erdős-Ko-Rado theorem is true for n=ckt
Péter Frankl · 1978
Earlier work this paper cites.
Triple systems with no six points carrying three triangles
Imre Z. Ruzsa and Endre Szemerédi · 1978
Earlier work this paper cites.
On a problem of Chvátal and Erdős on hypergraphs containing no generalized simplex
Péter Frankl · 1981
Earlier work this paper cites.
Intersection theorems with geometric consequences
Péter Frankl and Richard M. Wilson · 1981
Earlier work this paper cites.
On the critical percolation probabilities
Lucio Russo · 1981
Earlier work this paper cites.
An extremal set theoretic characterization of some Steiner systems
Péter Frankl · 1983
Earlier work this paper cites.
On finite set-systems whose every intersection is a Kernel of a star
Zoltán Füredi · 1983
Cited alongside, same era.
The exact bound in the Erdös-Ko-Rado theorem
Richard M Wilson · 1984
Cited alongside, same era.
Forbidding just one intersection
Péter Frankl and Zoltán Füredi · 1985
Cited alongside, same era.
Erdös-Ko-Rado theorem with conditions on the maximal degree
Péter Frankl · 1987
Cited alongside, same era.
Exact solution of some Turán-type problems
Péter Frankl and Zoltán Füredi · 1987
Cited alongside, same era.
Forbidden intersections
Péter Frankl and Vojtěch Rödl · 1987
Cited alongside, same era.
Combinatorics of finite sets
I. Anderson · 1989
Set systems without a simplex or a cluster
Peter Keevash and Dhruv Mubayi · 2010
Later among the works it cites.
Recent developments in extremal combinatorics: Ramsey and Turán type problems
Benjamin Sudakov · 2010
Later among the works it cites.
Intersecting families of permutations
David Ellis, Ehud Friedgut, and Haran Pilpel · 2011
Later among the works it cites.
On r-cross intersecting families of sets
Péter Frankl and Norihide Tokushige · 2011
Later among the works it cites.
Hypergraph Turán problems
Peter Keevash · 2011
Later among the works it cites.
Triangle-intersecting families of graphs
David Ellis, Yuval Filmus, and Ehud Friedgut · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Some best possible inequalities concerning cross-intersecting families
Péter Frankl and Norihide Tokushige · 1992
Cited alongside, same era.
Cross-intersecting families of finite sets
Zoltán Füredi · 1995
Cited alongside, same era.
The complete nontrivial-intersection theorem for systems of finite sets
Rudolf Ahlswede and Levon H. Khachatrian · 1996
Cited alongside, same era.
Every monotone graph property has a sharp threshold
Ehud Friedgut and Gil Kalai · 1996
Cited alongside, same era.
The complete intersection theorem for systems of finite sets
Rudolf Ahlswede and Levon H. Khachatrian · 1997
Cited alongside, same era.
Hamed Hatami · 2012
Later among the works it cites.
The size of a hypergraph and its matching number
Hao Huang, Po-Shen Loh, and Benny Sudakov · 2012
Later among the works it cites.
Improved bounds for Erdős’ matching conjecture
Péter Frankl · 2013
Later among the works it cites.
Forbidding just one intersection, for permutations
David Ellis · 2014
Later among the works it cites.
Linear trees in uniform hypergraphs
Zoltán Füredi · 2014
Later among the works it cites.
Hypergraph Turán numbers of linear cycles
Zoltán Füredi and Tao Jiang · 2014
Later among the works it cites.
Exact solution of the hypergraph Turán problem for k-uniform linear paths
Zoltán Füredi, Tao Jiang, and Robert Seiver · 2014
Later among the works it cites.
Turán numbers for hypergrpah trees
Zoltan Füredi and Tao Jiang · 2015
Later among the works it cites.
Turán problems and shadows I: paths and cycles
Alexandr Kostochka, Dhruv Mubayi, and Jacques Verstraëte · 2015
Later among the works it cites.
Turán problems and shadows III: expansions of graphs
Alexandr Kostochka, Dhruv Mubayi, and Jacques Verstraëte · 2015
Later among the works it cites.
Combinatorial theorems in sparse random sets
David Conlon and W. T. Gowers · 2016
Later among the works it cites.
David Ellis, Nathan Keller, and Noam Lifshitz · 2016
Later among the works it cites.
Invitation to intersection problems for finite sets
Péter Frankl and Norihide Tokushige · 2016
Later among the works it cites.
A survey of Turán problems for expansions
Dhruv Mubayi and Jacques Verstraëte · 2016
Later among the works it cites.
Extremal results for random discrete structures
Mathias Schacht · 2016
Later among the works it cites.
A rainbow r-partite version of the Erdős-Ko-Rado theorem
Ron Aharoni and David M. Howard · 2017
Closest in time.
Frankl-Rödl type theorems for codes and permutations
Peter Keevash and Eoin Long · 2017
Closest in time.
Turán problems and shadows II: trees
Alexandr Kostochka, Dhruv Mubayi, and Jacques Verstraëte · 2017
Closest in time.
Kneser graphs are like swiss cheese
Ehud Friedgut and Oded Regev · 2018
Closest in time.
Stability versions of Erdős–Ko–Rado type theorems, via isoperimetry
David Ellis, Nathan Keller, and Noam Lifshitz · 2019
Closest in time.
Approximation by juntas in the symmetric group and forbidden intersection problems
David Ellis and Noam Lifshitz · 2019
Closest in time.
Hypercontractivity for global functions and sharp thresholds
Peter Keevash, Noam Lifshitz, Eoin Long, and Dor Minzer · 2019
Closest in time.
Hypergraph removal lemmas via robust sharp threshold theorems
Noam Lifshitz · 2020
Closest in time.