Mantel's theorem for random graphs

DOI10.1002/rsa.20535zbMath1328.05169arXiv1206.1016OpenAlexW1509611772WikidataQ105583296 ScholiaQ105583296MaRDI QIDQ3192372

Bobby DeMarco, Jeffry Kahn

Publication date: 12 October 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.1016

zbMATH Keywords

random graphthresholdmax cutMantel's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (12)

Triangle-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 ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Triangle-Free Subgraphs of Random Graphs ⋮ On \(k\)-uniform random hypergraphs without generalized fans ⋮ Mantel's theorem for random hypergraphs ⋮ Random sum-free subsets of abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ Triangle-free subgraphs of hypergraphs ⋮ On Erdős–Ko–Rado for random hypergraphs I

Cites Work

• Unnamed Item
• On the triangle space of a random graph
• The clique complex and hypergraph matching
• Topology of random clique complexes
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• On \(K^ 4\)-free subgraphs of random graphs
• Extremal subgraphs of random graphs
• On Sets of Acquaintances and Strangers at any Party
• Extremal subgraphs of random graphs
• Arithmetic progressions of length three in subsets of a random set
• Independent sets in hypergraphs
• Stability results for random discrete structures

This page was built for publication: Mantel's theorem for random graphs