Extremal and probabilistic combinatorics. Paper from the 28th Brazilian mathematics colloquium -- 28^ o Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011

zbMATH Open1250.05003MaRDI QIDQ3097385FDOQ3097385

Authors: Robert Morris, Roberto I. Oliveira 

Publication date: 16 November 2011

Full work available at URL: http://impa.br/wp-content/uploads/2017/04/28CBM_04.pdf

Recommendations

• Elementary methods of graph Ramsey theory
• Extremal combinatorics. With applications in computer science
• scientific article; zbMATH DE number 1324671
• Lectures on advances in combinatorics
• scientific article; zbMATH DE number 734955

zbMATH Keywords

Kneser graphrandom graphsRamsey's theoremBorsuk's conjectureSchur's theoremVan der Waerden's theoremRoth's theoremBorsuk-Ulam TheoremFKG inequalityErdős-Stone theoremFrankl-Wilson inequalitiesJanson inequalitiesRamsey-Turán numbers, Balog-Szemerédi-Gowers theoremSzemerédi's regularity lemmaTurán's theorem

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Extremal combinatorics (05Dxx)

Cited In (4)

• Topics in modern combinatorics. 23rd Brazilian mathematics colloquium.
• An Introduction to Combinatorial Existence Theorems
• Title not available (Why is that?)
• Extremal combinatorics. With applications in computer science

This page was built for publication: Extremal and probabilistic combinatorics. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097385)