Extremal subgraphs of random graphs
From MaRDI portal
Publication:4712122
DOI10.1002/jgt.3190140511zbMath0738.05048DBLPjournals/jgt/BabaiSS90OpenAlexW2022933371WikidataQ97694088 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 (26)
Extremal subgraphs of random graphs ⋮ TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs ⋮ Mantel's theorem for random graphs ⋮ Extremal results for random discrete structures ⋮ Turán's extremal problem in random graphs: Forbidding odd cycles ⋮ Turán's theorem for pseudo-random graphs ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ On the maximum \(F_5\)-free subhypergraphs of a random hypergraph ⋮ The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ On \(k\)-uniform random hypergraphs without generalized fans ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Mantel's theorem for random hypergraphs ⋮ Counting sum-free sets in abelian groups ⋮ Random sum-free subsets of abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ On Erdős–Ko–Rado for random hypergraphs I ⋮ Stability‐type results for hereditary properties ⋮ Freiman Homomorphisms of Random Subsets of ⋮ Independent sets in hypergraphs
Cites Work
This page was built for publication: Extremal subgraphs of random graphs
