Results 71 to 80 of about 13,803 (191)
Structure and randomness in extremal combinatorics
, 2017 In this thesis we prove several results in extremal combinatorics from areas including Ramsey theory, random graphs and graph saturation. We give a random graph analogue of the classical Andr´asfai, Erd˝os and S´os theorem showing that in some ways subgraphs of sparse random graphs typically behave in a somewhat similar way to dense graphs.
openaire +2 more sources
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
Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New [PDF]
, 2022 Anthony Nixon +2 more
openalex +1 more source
Extremal Combinatorics and Universal Algorithms
, 2018 In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we focus on some new automata that do not seem to have occurred much in the literature, that of solvability of mazes.
openaire +2 more sources
Universal models for Lorenz maps
, 1996 The existence of smooth families of Lorenz maps exhibiting all possible dynamical behavior is established and the structure of the parameter space of these families is ...
de Melo, Welington, Martens, Marco
core +1 more source
, 2020 The well-known Sauer lemma states that a family $\mathcal{F}\subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i=0}^d\binom{n}{i}$. We obtain both random and explicit constructions to prove that the corresponding saturation number, i ...
Frankl, Nóra +4 more
core
on problems in extremal combinatorics
, 2016 Extremal Combinatorics studies how large or how small a structure can be, if it does not contain certain forbidden configuration. One of its major areas of study is extremal set theory, where the structures considered are families of sets, and the forbidden configurations are restricted intersection patterns.
openaire +2 more sources
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
An extremal problem on potentially $K_{m}-P_{k}$-graphic sequences
, 2005 A sequence $S$ is potentially $K_{m}-P_{k}$ graphical if it has a realization containing a $K_{m}-P_{k}$ as a subgraph. Let $\sigma(K_{m}-P_{k}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(
Lai, Chunhui
core +1 more source
Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New
, 2021 David Ellis
openalex +2 more sources