English
Related papers

Related papers: Set System Blowups

200 papers

We demonstrate the truth of the sunflower conjecture by showing that a family $\mathcal{F}$ of sets each of cardinality at most $m$ includes a $k$-sunflower, if $|\mathcal{F}| > ( c k )^{2m}$ for a constant $c>0$ independent of $m$ and $k$,…

Combinatorics · Mathematics 2026-04-29 Junichiro Fukuyama

Given a family $\mathcal F$ of $k$-element sets, $S_1,\ldots,S_r\in\mathcal F$ form an {\em $r$-sunflower} if $S_i \cap S_j =S_{i'} \cap S_{j'}$ for all $i \neq j$ and $i' \neq j'$. According to a famous conjecture of Erd\H os and Rado…

Combinatorics · Mathematics 2021-03-29 Jacob Fox , Janos Pach , Andrew Suk

A sunflower with $k$ petals, or $k$-sunflower, is a family of $k$ sets every two of which have a common intersection. Known since 1960, the sunflower conjecture states that a family ${\mathcal F}$ of sets each of cardinality $m$ includes a…

Combinatorics · Mathematics 2021-12-28 Junichiro Fukuyama

A family of $r$ distinct sets $\{A_1,\ldots, A_r\}$ is an $r$-sunflower if for all $1 \leqslant i < j \leqslant r$ and $1 \leqslant i' < j' \leqslant r$, we have $A_i \cap A_j = A_{i'} \cap A_{j'}$. Erd\H{o}s and Rado conjectured in 1960…

Combinatorics · Mathematics 2025-09-25 József Balogh , Anton Bernshteyn , Michelle Delcourt , Asaf Ferber , Huy Tuan Pham

We show that a family $\mathcal{F}$ of sets each of cardinality $m \in \mathbb{Z}_{>2}$ includes a $k$-sunflower if $ |\mathcal{F}| \ge \left( \frac{c k^2 \ln m}{\ln \ln m} \right)^m$ for some constant $c>0$, where $k$-sunflower means a…

Combinatorics · Mathematics 2025-12-03 Junichiro Fukuyama

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…

Combinatorics · Mathematics 2019-02-20 Tom Eccles

Let $f(k,r,s)$ stand for the least number so that if $\cal F$ is an arbitrary $k$-uniform, $L$-intersecting set system, where $|L|=s$, and $\cal F$ has more than $f(k,r,s)$ elements, then $\cal F$ contains a sunflower with $r$ petals. We…

Combinatorics · Mathematics 2016-10-10 Gábor Hegedűs

A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection $C$ of all of them, and $|C|$ is smaller than each of the sets. A longstanding conjecture due to Erd\H{o}s and…

Combinatorics · Mathematics 2025-01-29 Dhruv Mubayi , Lujia Wang

Let $X$ be an $n$-element set. A set-pair system $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ is a collection of pairs of disjoint subsets of $X$. It is called skew Bollob\'as system if $A_i\cap B_j\neq \emptyset$ for all $1\leq i<j \leq…

Combinatorics · Mathematics 2023-07-28 Gábor Hegedüs , Péter Frankl

A collection of $k$ sets is said to form a $k$-sunflower, or $\Delta$-system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal{F}$ sunflower-free if it contains no sunflowers.…

Combinatorics · Mathematics 2023-03-13 Eric Naslund , William F. Sawin

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Combinatorics · Mathematics 2018-11-07 Ze-Chun Hu , Shi-Lun Li

A sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all of them. Erd\H{o}s and Rado proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$,…

Combinatorics · Mathematics 2021-09-01 Ryan Alweiss , Shachar Lovett , Kewen Wu , Jiapeng Zhang

Extending the notion of sunflowers, we call a family of at least two sets an odd-sunflower if every element of the underlying set is contained in an odd number of sets or in none of them. It follows from the Erd\H os--Szemer\'edi…

Combinatorics · Mathematics 2024-03-22 Peter Frankl , János Pach , Dömötör Pálvölgyi

It has been known for a long time that the equivariant 2+1 wave map into the 2-sphere blows up if the initial data are chosen appropriately. Here, we present numerical evidence for the stability of the blow-up phenomenon under explicit…

Mathematical Physics · Physics 2012-05-15 Jörg Frauendiener , Ralf Peter

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

Combinatorics · Mathematics 2007-05-23 Robert Morris

A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an…

Combinatorics · Mathematics 2009-04-24 William Y. C. Chen , Jiuqiang Liu , Larry X. W. Wang

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

Combinatorics · Mathematics 2013-05-06 Richard P. Anstee , Linyuan Lu

Let $H$ and $H'$ be two ample line bundles over a smooth projective surface $X$, and $M(H)$ (resp. $M(H')$) the coarse moduli scheme of $H$-semistable (resp. $H'$-semistable) sheaves of fixed type $(r,c_1,c_2)$. We construct a sequence of…

Algebraic Geometry · Mathematics 2007-05-23 Kimiko Yamada

We study positive blowing-up solutions of the system: $$u_{t}-\delta\Delta u=v^p,\,\,\, v_{t}-\Delta v=u^{q},$$ as well as of some more general systems. For any $p,\,q>1$, we prove single-point blow-up for any radially decreasing, positive…

Analysis of PDEs · Mathematics 2016-04-07 Nejib Mahmoudi , Philippe Souplet , Slim Tayachi

Mubayi's Conjecture states that if $\mathcal{F}$ is a family of $k$-sized subsets of $[n] = \{1,\ldots,n\}$ which, for $k \geq d \geq 2$, satisfies $A_1 \cap\cdots\cap A_d \neq \emptyset$ whenever $|A_1 \cup\cdots\cup A_d| \leq 2k$ for all…

Combinatorics · Mathematics 2018-11-01 Adam Mammoliti , Thomas Britz
‹ Prev 1 2 3 10 Next ›