Induced subgraphs with distinct sizes

DOI10.1002/rsa.20250zbMath1187.05049OpenAlexW4253452345MaRDI QIDQ3608312

Noga Alon, Alexandr V. Kostochka

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1002/rsa.20250

zbMATH Keywords

induced subgraphsrandom graphRamsey graphssizes of subgraphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

The multiplication table problem for bipartite graphs ⋮ On the sizes of large subgraphs of the binomial random graph ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Sizes of Induced Subgraphs of Ramsey Graphs ⋮ The parameterized complexity of \(k\)-edge induced subgraphs ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Anticoncentration for subgraph statistics ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs

Cites Work

• Induced subgraphs of Ramsey graphs with many distinct degrees
• Cutting a graph into two dissimilar halves
• Graphs Having Small Number of Sizes on Induced k‐Subgraphs

This page was built for publication: Induced subgraphs with distinct sizes