Problems and results in extremal combinatorics. III.

DOI10.4310/JOC.2016.V7.N2.A2MaRDI QIDQ286750zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 25 May 2016

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2016.v7.n2.a2

zbMATH Keywords

list coloringtournamenthomometric sets in graphssign matricesSteiner systems

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Other combinatorial number theory (11B75) Extremal combinatorics (05D99) Triple systems (05B07)

Recommendations

• Problems and results in extremal combinatorics. II
• Problems and results in extremal combinatorics. I.
• Recent developments in extremal combinatorics: Ramsey and Turán type problems
• Problems and results in combinatorial analysis and graph theory
• Short proofs of some extremal results. III

Cited in

(12)

• On attractive and friendly sets in sequence spaces
• Extremal problems under dimension constraints.
• Recent developments in extremal combinatorics: Ramsey and Turán type problems
• Formalising the Kruskal-Katona theorem in Lean
• Short proofs of some extremal results. II.
• Local-vs-global combinatorics
• Problems and results in extremal combinatorics. II
• Short proofs of some extremal results. III
• On Attractive and Friendly Sets in Sequence Spaces
• On the maximum number of spanning copies of an orientation in a tournament
• Short proofs of some extremal results
• Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs

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

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