TY - CHAP
T1 - Problems and Results in Extremal Combinatorics–V
AU - Alon, Noga
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
PY - 2026
Y1 - 2026
N2 - Frankl, Füredi, Győri and Pach obtained fundamental results in extremal combinatorics, graph theory and discrete geometry. In this paper we describe solutions or partial solutions of several problems in these areas. The problems considered deal with bipartite coverings of graphs, triangle-free graphs of diameter 2, and geometric and combinatorial designs and partial designs. This is a (short) sequel of several previous papers of the same flavour. Each section here is essentially self contained, and can be read separately.
AB - Frankl, Füredi, Győri and Pach obtained fundamental results in extremal combinatorics, graph theory and discrete geometry. In this paper we describe solutions or partial solutions of several problems in these areas. The problems considered deal with bipartite coverings of graphs, triangle-free graphs of diameter 2, and geometric and combinatorial designs and partial designs. This is a (short) sequel of several previous papers of the same flavour. Each section here is essentially self contained, and can be read separately.
UR - https://www.scopus.com/pages/publications/105040542736
UR - https://www.scopus.com/pages/publications/105040542736#tab=citedBy
U2 - 10.1007/978-3-032-18810-6_2
DO - 10.1007/978-3-032-18810-6_2
M3 - Chapter
AN - SCOPUS:105040542736
T3 - Bolyai Society Mathematical Studies
SP - 13
EP - 29
BT - Bolyai Society Mathematical Studies
PB - Springer Science and Business Media Deutschland GmbH
ER -