Results 81 to 90 of about 58,072 (195)
Problems in Discrete Geometry and Extremal Combinatorics
, 2018 We study several problems in discrete geometry and extremal combinatorics. Discrete geometry studies the combinatorial properties of finite sets of simple geometric objects. One theme of the field is geometric Ramsey theory. Given m geometric objects, we
Zilin Jiang (5364491)
core +1 more source
Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
Discrete Analysis, 2017 Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case, Discrete Analysis 2017:5, 34 pp. Szemerédi's theorem, proved in 1975, asserts that for every positive integer $k$ and every $\delta>0$ there exists $n$ such that every subset
Sean Prendiville
doaj +1 more source
Some Results in Extremal Combinatorics [PDF]
, 2013 Extremal Combinatorics is one of the central and heavily contributed areas in discrete mathematics, and has seen an outstanding growth during the last few decades.
Ahmed, Tanbir
core +1 more source
Discrete Analysis, 2017 Quasirandom Cayley graphs, Discrete Analysis 2017:6, 14 pp. An extremely important phenomenon in extremal combinatorics is that of _quasirandomness_: for many combinatorial structures, it is possible to identify a list of deterministic properties, each ...
David Conlon, Yufei Zhao
doaj +1 more source
Two problems in extremal combinatorics
, 2021 In this thesis, we focus on two problems in extremal graph theory. Extremal graph theory consists of all problems related to optimizing parameters defined on graphs. The concept of ``editing'' appears in many key results and techniques in extremal graph theory, either as a means to account for error in structural results, or as a quantity to minimize ...
openaire +4 more sources
A superadditivity and submultiplicativity property for cardinalities of sumsets [PDF]
, 2010 For finite sets of integers A1, . . . ,An we study the cardinality of the n-fold sumset A1 + · · · + An compared to those of (n − 1)-fold sumsets A1 + · · · + Ai−1 + Ai+1 + · · · + An.
Matolcsi, Máté +5 more
core +1 more source
Power saving for the Brown-Erdős-Sós problem
Discrete AnalysisPower saving for the Brown-Erdős-Sós problem, Discrete Analysis 2025:5, 16 pp. It has long been known that there are important connections between extremal questions concerning hypergraphs and extremal questions in additive combinatorics.
Oliver Janzer +3 more
doaj +1 more source
A note on some extremal problems for trigonometric polynomials [PDF]
n.a.
Dette, Holger, Melas, Viatcheslav B.
core
Representation theory methods in extremal combinatorics
, 2016 Xiang, QingThe research of this thesis lies in the area of extremal combinatorics. The word "extremal" comes from the kind of problems that are studied in this field.
Plaza, Rafael
core +1 more source
Coloring and extremal problems in combinatorics
, 2018 Coloring problems concern partitions of structures. The classic problem of partitioning the set of integers into a finite number of pieces so that no one piece has an arithmetic progression of a fixed length was solved in 1927. Van der Waerden's Theorem shows that it is impossible to do so.
openaire +3 more sources