English
Related papers

Related papers: Erd\"os's Matching Conjecture and $s$-wise $t$-int…

200 papers

A family $\mathcal{F}$ on ground set $[n]:=\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of at most $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while…

Combinatorics · Mathematics 2023-02-28 József Balogh , Ce Chen , Kevin Hendrey , Ben Lund , Haoran Luo , Casey Tompkins , Tuan Tran

Ever since the famous Erd\H{o}s-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.…

Combinatorics · Mathematics 2021-01-12 Xiangliang Kong , Yuanxiao Xi , Bingchen Qian , Gennian Ge

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

Combinatorics · Mathematics 2015-07-15 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya Stein , Endre Szemerédi

We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schr\"oder…

Combinatorics · Mathematics 2012-09-25 Frédéric Bosio , Marc A. A. Van Leeuwen

An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erd\H{o}s--Ko--Rado theorem: when $n> 2k$, every non-trivial intersecting family…

Combinatorics · Mathematics 2017-05-30 Peter Frankl , Jie Han , Hao Huang , Yi Zhao

We prove that a family of pseudo-Paley graphs of square order obtained from unions of cyclotomic classes satisfies the Erd\H{o}s-Ko-Rado (EKR) module property, in a sense that the characteristic vector of each maximum clique is a linear…

Combinatorics · Mathematics 2023-01-02 Shamil Asgarli , Sergey Goryainov , Huiqiu Lin , Chi Hoi Yip

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…

Probability · Mathematics 2020-08-10 Manjunath Krishnapur

We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao's solution to Varchenko's conjecture on complements of hyperplane…

Algebraic Geometry · Mathematics 2019-02-20 June Huh

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with…

Combinatorics · Mathematics 2013-04-09 Clemens Heuberger , Stephan Wagner

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…

Combinatorics · Mathematics 2024-02-27 Jozsef Solymosi , Joshua Zahl

A family $\mathcal{F} \subset \mathcal{P}(n)$ is $r$-wise $k$-intersecting if $|A_1 \cap \dots \cap A_r| \geq k$ for any $A_1, \dots, A_r \in \mathcal{F}$. It is easily seen that if $\mathcal{F}$ is $r$-wise $k$-intersecting for $r \geq 2$,…

Combinatorics · Mathematics 2023-05-10 Agnijo Banerjee

We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum cardinality of the union of k sink-stable sets. The results imply a recent min-max theorem of Abeledo and Atkinson on the Clar number of…

Combinatorics · Mathematics 2012-05-29 Dóra Erdős , András Frank , Krisztián Kun

The maximum size of $t$-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erd\H{o}s-Ko-Rado theorem. Such intersecting families, also known as constant-weight anticodes in coding…

Combinatorics · Mathematics 2025-03-20 Xuan Wang , Tuvi Etzion , Denis Krotov , Minjia Shi

We study AECs without assuming the amalgamation property in general. We do assume the disjoint amalgamation property in a specific cardinality lambda and assume that there is no maximal model in \lambda. Under these hypotheses, we prove the…

Logic · Mathematics 2014-04-16 Adi Jarden

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such…

Number Theory · Mathematics 2007-05-23 Michael Filaseta , Kevin Ford , Sergei Konyagin , Carl Pomerance , Gang Yu

Let A be an abelian variety over a number field K. An identity between the L-functions L(A/K_i,s) for extensions K_i of K induces a conjectural relation between the Birch-Swinnerton-Dyer quotients. We prove these relations modulo finiteness…

Number Theory · Mathematics 2013-09-23 Tim Dokchitser , Vladimir Dokchitser

A family of subsets $\mathcal{F}$ is intersecting if $A \cap B \neq \emptyset$ for any $A, B \in \mathcal{F}$. In this paper, we show that for given integers $k > d \ge 2$ and $n \ge 2k+2d-3$, and any intersecting family $\mathcal{F}$ of…

Combinatorics · Mathematics 2024-07-22 Hao Huang , Yi Zhang

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

Logic · Mathematics 2024-07-16 Michael C. Laskowski , Danielle S. Ulrich

Enochs Conjecture asserts that each covering class of modules (over any ring) has to be closed under direct limits. Although various special cases of the conjecture have been verified, the conjecture remains open in its full generality. In…

Rings and Algebras · Mathematics 2023-11-08 Silvana Bazzoni , Jan Šaroch

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending classical results in vector and polar spaces. This line of…

Combinatorics · Mathematics 2025-05-21 Jan De Beule , Philipp Heering , Sam Mattheus , Klaus Metsch