Results 81 to 90 of about 14,970 (213)
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
On Lev's periodicity conjecture
Bulletin of the London Mathematical Society, Volume 57, Issue 5, Page 1496-1511, May 2025.Abstract We classify the sum‐free subsets of F3n${\mathbb {F}}_3^n$ whose density exceeds 16$\frac{1}{6}$. This yields a resolution of Vsevolod Lev's periodicity conjecture, which asserts that if a sum‐free subset A⊆F3n${A\subseteq {\mathbb {F}}_3^n}$ is maximal with respect to inclusion and aperiodic (in the sense that there is no non‐zero vector v$v$
Christian Reiher
wiley +1 more source
Integer colorings with forbidden rainbow sums
, 2020 For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free sets, which ...
Cheng, Yangyang +4 more
core
Effects of altitude and exercise intensity on cardiac function in rats
Experimental Physiology, Volume 110, Issue 5, Page 735-743, 1 May 2025.Abstract High‐altitude exercise affects cardiac function. This study investigated how altitude and exercise intensity interacted to affect cardiac function of Sprague‐Dawley rats. Four altitudes (410, 3600, 4600 and 5600 m) and three exercise intensities (non‐exercise (N), low‐intensity exercise (L) and high‐intensity exercise (H)) were tested ...
Minxia Zhu +7 more
wiley +1 more source
Partitions of Matrix Spaces With an Application to $q$-Rook Polynomials
, 2019 We study the row-space partition and the pivot partition on the matrix space $\mathbb{F}_q^{n \times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual.
Gluesing-Luerssen, Heide +1 more
core +1 more source
Vocal Learning Versus Speech Evolution: Untangling a False Equivalence
Ecology and Evolution, Volume 15, Issue 4, April 2025.ABSTRACT The evolution of speech remains one of the most profound and unresolved questions in science. Despite significant advancements in comparative research, key assumptions about the evolutionary precursors of speech continue to be accepted with minimal scrutiny.
Adriano R. Lameira
wiley +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
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph
Journal of Graph Theory, Volume 108, Issue 4, Page 817-818, April 2025.ABSTRACT Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion‐wise minimal vertex cuts in a graph on n $n$ vertices is at most 1.889 9 n $1.889{9}^{n}$ for large enough n $n$.
Domagoj Bradač
wiley +1 more source
The Turán problem for hypergraphs of fixed size [PDF]
, 2005 We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If F is an r-uniform hypergraph with f edges we show that [pi](F) =3 and f->[infinity]
Keevash, Peter
core
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