Related papers: Formations and generalized Davenport-Schinzel sequ…

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

Garnero et al. [SIAM J. Discrete Math. 2015, 29(4):1864--1894] recently introduced a framework based on dynamic programming to make applications of the protrusion replacement technique constructive and to obtain explicit upper bounds on the…

A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the…

For a fixed positive integer $k$ and a graph $G$, let $\lambda_k(G)$ denote the $k$-th largest eigenvalue of the adjacency matrix of $G$. In 2017, Tait and Tobin proved that the maximum $\lambda_1(G)$ among all outerplanar graphs on $n$…

For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao…

For a simple graph $F$, let $\mathrm{EX}(n, F)$ and $\mathrm{EX_{sp}}(n,F)$ be the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an $n$-vertex graph without any copy of the graph…

In this paper, we study the problem of determining the maximum number of edges in an $n$-vertex $r$-uniform hypergraph that contains no $(k+1)$-connected subgraph. The graph case is a classical problem initiated by Mader, central to graph…

In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to…

We give an upper bound for the maximum number of edges in an $n$-vertex 2-connected $r$-uniform hypergraph with no Berge cycle of length $k$ or greater, where $n\geq k \geq 4r\geq 12$. For $n$ large with respect to $r$ and $k$, this bound…

First, we prove tight bounds of $n 2^{\frac{1}{(t-2)!}\alpha(n)^{t-2} \pm O(\alpha(n)^{t-3})}$ on the extremal function of the forbidden pair of ordered sequences $(1 2 3 \ldots k)^t$ and $(k \ldots 3 2 1)^t$ using bounds on a class of…

Recently, several hypergraph Tur\'{a}n problems were solved by the powerful random algebraic method. However, the random algebraic method usually requires some parameters to be very large, hence we are concerned about how these Tur\'{a}n…

In this paper we present a novel approach in extremal set theory which may be viewed as an asymmetric version of Katona's permutation method. We use it to find more Tur\'an numbers of hypergraphs in the Erd\H{o}s--Ko--Rado range. An…

We determine the colored patterns that appear in any $2$-edge coloring of $K_{n,n}$, with $n$ large enough and with sufficient edges in each color. We prove the existence of a positive integer $z_2$ such that any $2$-edge coloring of…

For a graph $F$, the $k$-subdivision of $F$, denoted $F^k$, is the graph obtained by replacing the edges of $F$ with internally vertex-disjoint paths of length $k$. In this paper, we prove that…

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

For integers $k$ and $\ell$, let $\operatorname{ind}(k, \ell)$ be the maximum proportion of $k$-vertex subsets of a large graph that induce exactly $\ell$ edges. The edge-statistics theorem (conjectured by Alon-Hefetz-Krivelevich-Tyomkyn,…

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for…

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeroes. Let $f(n,P,d)$ denote the maximum number of ones in a $d$-dimensional…