Extremal subgraphs of random graphs

From MaRDI portal
Publication:4712122

DOI10.1002/jgt.3190140511zbMath0738.05048OpenAlexW2022933371WikidataQ97694088 ScholiaQ97694088MaRDI QIDQ4712122

László Babai, J. H. Spencer, Miklós Simmonovits

Publication date: 25 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140511




Related Items

Extremal subgraphs of random graphsTRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREMOn the minimal degree implying equality of the largest triangle-free and bipartite subgraphsMantel's theorem for random graphsExtremal results for random discrete structuresTurán's extremal problem in random graphs: Forbidding odd cyclesTurán's theorem for pseudo-random graphsOn \(K^ 4\)-free subgraphs of random graphsOn the stability of the Erdős-Ko-Rado theoremOn the maximum \(F_5\)-free subhypergraphs of a random hypergraphThe Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian GroupsAn analogue of the Erdős-Gallai theorem for random graphsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsExtremal results for odd cycles in sparse pseudorandom graphsOn \(k\)-uniform random hypergraphs without generalized fansTurán numbers for Berge-hypergraphs and related extremal problemsMantel's theorem for random hypergraphsCounting sum-free sets in abelian groupsRandom sum-free subsets of abelian groupsThe typical structure of sparse $K_{r+1}$-free graphsOn the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphsOn Erdős–Ko–Rado for Random Hypergraphs IIOn Erdős–Ko–Rado for random hypergraphs IStability‐type results for hereditary propertiesFreiman Homomorphisms of Random Subsets ofIndependent sets in hypergraphs



Cites Work