Results 41 to 50 of about 125 (122)

Size‐Ramsey Numbers of Structurally Sparse Graphs

Random Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT Size‐Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau, and Schelp in 1978. Research has mainly focused on the size‐Ramsey numbers of n$$ n $$‐vertex graphs with constant maximum degree Δ$$ \Delta $$.
Nemanja Draganić, Marc Kaufmann, David Munhá Correia, Kalina Petrova, Raphael Steiner   +4 more
wiley   +1 more source

On the number of $\mathcal {H}$ -free hypergraphs

Forum of Mathematics, Sigma
Two central problems in extremal combinatorics are concerned with estimating the number $\mathrm {ex}(n,\mathcal {H})$ , the size of the largest $\mathcal {H}$ -free hypergraph on n vertices, and the number $\mathrm {forb}(n,\mathcal {H})$
Tao Jiang, Sean Longbrake
doaj   +1 more source

Hypergraph removal lemmas via robust sharp threshold theorems

Discrete Analysis, 2020
Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj   +1 more source

Diophantine tuples and product sets in shifted powers

Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley   +1 more source

Coloring and density theorems for configurations of a given volume

Proceedings of the London Mathematical Society, Volume 132, Issue 3, March 2026.
Abstract This is a treatise on finite point configurations spanning a fixed volume to be found in a single color‐class of an arbitrary finite (measurable) coloring of the Euclidean space Rn$\mathbb {R}^n$, or in a single large measurable subset A⊆Rn$A\subseteq \mathbb {R}^n$.
Vjekoslav Kovač
wiley   +1 more source

Assembly of constructible factorization algebras

Journal of Topology, Volume 19, Issue 1, March 2026.
Abstract We provide a toolbox of extension, gluing, and assembly techniques for factorization algebras. Using these tools, we fill various gaps in the literature on factorization algebras on stratified manifolds, the main one being that constructible factorization algebras form a sheaf of symmetric monoidal ∞$\infty$‐categories.
Eilind Karlsson, Claudia I. Scheimbauer, Tashi Walde   +2 more
wiley   +1 more source

Kneser graphs are like Swiss cheese

Discrete Analysis, 2018
Kneser graphs are like Swiss cheese, Discrete Analysis 2018:2, 18 pp. This paper relates two very interesting areas of research in extremal combinatorics: removal lemmas, and influence of variables.
Ehud Friedgut, Oded Regev
doaj   +1 more source

Dimer models and conformal structures

Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala, Erik Duse, István Prause, Xiao Zhong   +3 more
wiley   +1 more source

Cluster‐Randomized Trials in Emergency Care Research

Academic Emergency Medicine, Volume 33, Issue 2, February 2026.
ABSTRACT Objective Cluster‐randomized trials (also called group‐randomized trials) are increasingly common in emergency care research. In such trials, groups of participants are allocated to different interventions based on naturally occurring “clusters,” such as clinics, hospitals, or emergency medical services agencies. In this methodological review,
Howard S. Kim, Jacob M. Schauer, Jody D. Ciolino   +2 more
wiley   +1 more source

Undecidability of polynomial inequalities in weighted graph homomorphism densities

Forum of Mathematics, Sigma
Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights.
Grigoriy Blekherman, Annie Raymond, Fan Wei   +2 more
doaj   +1 more source