Problems and results in extremal combinatorics. II

DOI10.1016/j.disc.2007.08.090zbMath1152.05053OpenAlexW3004234532MaRDI QIDQ941386

Noga Alon

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.090

zbMATH Keywords

covering codesextremal graph theorypolyhedral combinatoricscoupon collectorprobabilistic combinatorics

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial probability (60C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Extremal combinatorics (05Dxx)

Related Items (13)

Short proofs of some extremal results. II. ⋮ Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Optimal cover time for a graph-based coupon collector process ⋮ A combinatorial approach to Ebert's hat game with many colors ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ Polychromatic colorings of plane graphs ⋮ Short Proofs of Some Extremal Results ⋮ Discovery Through Gossip ⋮ Short proofs of some extremal results III ⋮ Hamilton cycles in graph bundles over a cycle with tree as a fibre ⋮ Hats, auctions and derandomization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• The expressive power of voting polynomials
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Problems and results in extremal combinatorics. I.
• Dense graphs without 3-regular subgraphs
• Oriented list colorings of graphs
• A stochastic process on the hypercube with applications to peer-to-peer networks
• On Optimal Rules of Persuasion
• On a problem of K. Zarankiewicz

This page was built for publication: Problems and results in extremal combinatorics. II