English
Related papers

Related papers: Sunflower Bound with a Sub-Logarithmic Base

200 papers

For a prime number $\ell$ and an extension of number fields $K/F$, we prove new lower bounds on the $\ell$-rank of the ideal class group of $K$ based on prime ramification in $K/F$. Unlike related results from the literature, our bound is…

Number Theory · Mathematics 2025-01-20 Daniel E. Martin

Let $K$ be a set of $k$ positive integers. A biclique cover of type $K$ of a graph $G$ is a collection of complete bipartite subgraphs of $G$ such that for every edge $e$ of $G$, the number of bicliques need to cover $e$ is a member of $K$.…

Combinatorics · Mathematics 2013-01-22 Farokhlagha Moazami , Nasrin Soltankhah

We introduce a new link invariant called the algebraic genus, which gives an upper bound for the topological slice genus of links. In fact, the algebraic genus is an upper bound for another version of the slice genus proposed here: the…

Geometric Topology · Mathematics 2020-06-25 Peter Feller , Lukas Lewark

Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which…

Combinatorics · Mathematics 2007-07-12 Daniela Kühn , Deryk Osthus , Andrew Young

A graph $G$ is $k$-critical if $G$ is not $(k-1)$-colorable, but every proper subgraph of $G$ is $(k-1)$-colorable. A graph $G$ is $k$-choosable if $G$ has an $L$-coloring from every list assignment $L$ with $|L(v)|=k$ for all $v$, and a…

Combinatorics · Mathematics 2019-11-18 Daniel W. Cranston , Landon Rabern

In 1980, Gupta, Kahn and Robertson proved that every graph $G$ with minimum degree at least $k\geq 2$ contains a cycle $C$ containing at least $k+1$ vertices each having at least $k$ neighbors in $C$ (so $C$ has at least…

Combinatorics · Mathematics 2025-10-13 Zdeněk Dvořák , Beatriz Martins , Stéphan Thomassé , Nicolas Trotignon

Let $n > k > t \geq j \geq 1$ be integers. Let $X$ be an $n$-element set, ${X\choose k}$ the collection of its $k$-subsets. A family $\mathcal F \subset {X\choose k}$ is called $t$-intersecting if $|F \cap F'| \geq t$ for all $F, F' \in…

Combinatorics · Mathematics 2021-01-11 P. Frankl , G. O. H. Katona

A standard seaweed subalgebra of $A_{n-1}=\mathfrak{sl}(n)$ may be parametrized by a pair of compositions of the positive integer $n$. For all $n$ and certain $k(n)$, we provide closed-form formulas and the generating functions for $C(n,k)$…

Combinatorics · Mathematics 2018-08-06 Vincent E. Coll, , Aria Dougherty , Matthew Hyatt , Andrew W. Mayers , Nick W. Mayers

A $\frac{1}{k}$-majority $l$-edge-colouring of a graph $G$ is a colouring of its edges with $l$ colours such that for every colour $i$ and each vertex $v$ of $G$, at most $\frac{1}{k}$'th of the edges incident with $v$ have colour $i$. We…

Combinatorics · Mathematics 2023-09-29 Paweł Pękała , Jakub Przybyło

Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…

Number Theory · Mathematics 2022-03-16 Simran Tinani , Joachim Rosenthal

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

Combinatorics · Mathematics 2020-07-08 Alireza Abdollahi , Russ Woodroofe , Gjergji Zaimi

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

Combinatorics · Mathematics 2021-12-03 Jared Bitz , Sarah Griffith , Xiaoyu He

For any $k\ge 3$ and $\ell \in [k-1]$ such that $(k,\ell) \ne (3,1)$, we show that any sufficiently large $k$-graph $G$ must contain a Hamilton $\ell$-cycle provided that it has no isolated vertices and every set of $k-1$ vertices contained…

Combinatorics · Mathematics 2025-12-10 Shoham Letzter , Arjun Ranganathan

Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq[n]^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the…

Combinatorics · Mathematics 2022-06-10 Marcelo Sales , Bjarne Schülke

We show that if G is a group and A is a finite subset of G with |A^2| < K|A|, then for all k there is a symmetric neighbourhood of the identity S with S^k a subset of A^2A^{-2} and |S| > exp(-K^{O(k)})|A|.

Combinatorics · Mathematics 2010-10-15 Tom Sanders

A concrete lower-bound for the Hochschild cohomological dimension of a commutative $k$-algebra, in terms of three other homological invariants is obtained. This result is then used to show that most $k$-algebras fail to be quasi-free, even…

Rings and Algebras · Mathematics 2021-01-28 Anastasis Kratsios

A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular…

Discrete Mathematics · Computer Science 2019-03-18 Parinya Chalermsook , Andreas Schmid , Sumedha Uniyal

We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic…

Combinatorics · Mathematics 2016-05-17 Penny Haxell , Alex Scott

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Combinatorics · Mathematics 2024-11-08 Gábor Hegedüs

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

Combinatorics · Mathematics 2017-12-07 Jesse Geneson