Extremal subgraphs of random graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(44)- On \(K^ 4\)-free subgraphs of random graphs
- Many cliques in \(H\)-free subgraphs of random graphs
- Upper tails for subgraph counts in random graphs
- Turán's extremal problem in random graphs: Forbidding odd cycles
- Turán numbers for Berge-hypergraphs and related extremal problems
- Counting sum-free sets in abelian groups
- Random sum-free subsets of abelian groups
- On the minimal degree condition of graphs implying equality of the largest K_r-free subgraphs and (r - 1)-partite subgraphs
- An analogue of the Erdős-Gallai theorem for random graphs
- On \(k\)-uniform random hypergraphs without generalized fans
- Extremal paths in inhomogenous random graphs
- The typical structure of sparse \(K_{r+1}\)-free graphs
- Freiman homomorphisms of random subsets of Z_N
- On extremal subgraphs of random graphs
- Extremal subgraphs of random graphs
- Mantel's theorem for random graphs
- Extreme degrees in random subgraphs of regular graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 4210168 (Why is no real title available?)
- Transference for the Erdős-Ko-Rado theorem
- scientific article; zbMATH DE number 4164910 (Why is no real title available?)
- Extremal results for random discrete structures
- Stability-type results for hereditary properties
- Extreme degrees in random graphs
- Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs
- scientific article; zbMATH DE number 4110728 (Why is no real title available?)
- Turán's theorem in sparse random graphs
- K5‐free subgraphs of random graphs
- Triangle-free subgraphs of random graphs
- The Turn Theorem for Random Graphs
- Extremal results for odd cycles in sparse pseudorandom graphs
- Extremal Parameters in Sub-Critical Graph Classes
- On Erdős-Ko-Rado for random hypergraphs. II
- On Erdős-Ko-Rado for random hypergraphs. I
- Independent sets in hypergraphs
- The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
- Extremal results in random graphs
- Mantel's theorem for random hypergraphs
- Largest subgraph from a hereditary property in a random graph
- On the maximum \(F_5\)-free subhypergraphs of a random hypergraph
- On the random Turán number of linear cycles
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
- Turán's theorem for pseudo-random graphs
- On the stability of the Erdős-Ko-Rado theorem
This page was built for publication: Extremal subgraphs of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712122)