On the sizes of large subgraphs of the binomial random graph

DOI10.1016/j.disc.2021.112675zbMath1479.05322arXiv1904.05307OpenAlexW3205558229MaRDI QIDQ2666567

József Balogh, M. E. Zhukovskii

Publication date: 23 November 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphsrandom graphlarge subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trees in random graphs
• The distribution of the maximum degree of a random graph
• Degree sequences of random graphs
• Some recent problems and results in graph theory
• On the stability of the independence number of a random subgraph
• Largest sparse subgraphs of random graphs
• Induced subgraphs with distinct sizes
• Cliques in random graphs
• On the probability of independent sets in random graphs
• ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE
• On Induced Paths, Holes and Trees in Random Graphs
• Proof of a conjecture on induced subgraphs of Ramsey graphs

This page was built for publication: On the sizes of large subgraphs of the binomial random graph