Short proofs of some extremal results

We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.Comment: 19 page

Balanced supersaturation for some degenerate hypergraphs

A classical theorem of Simonovits from the 1980s asserts that every graph $G$ satisfying ${e(G) \gg v(G)^{1+1/k}}$ must contain $\gtrsim \left(\frac{e(G)}{v(G)}\right)^{2k}$ copies of $C_{2k}$. Recently, Morris and Saxton established a balanced version of Simonovits' theorem, showing that such $G$ has $\gtrsim \left(\frac{e(G)}{v(G)}\right)^{2k}$ copies of $C_{2k}$, which are `uniformly distributed' over the edges of $G$. Moreover, they used this result to obtain a sharp bound on the number of $C_{2k}$-free graphs via the container method. In this paper, we generalise Morris-Saxton's results for even cycles to $\Theta$-graphs. We also prove analogous results for complete $r$-partite $r$-graphs.Comment: Changed title, abstract and introduction were rewritte

Toric rings, inseparability and rigidity

This article provides the basic algebraic background on infinitesimal deformations and presents the proof of the well-known fact that the non-trivial infinitesimal deformations of a $K$-algebra $R$ are parameterized by the elements of cotangent module $T^1(R)$ of $R$. In this article we focus on deformations of toric rings, and give an explicit description of $T^1(R)$ in the case that $R$ is a toric ring. In particular, we are interested in unobstructed deformations which preserve the toric structure. Such deformations we call separations. Toric rings which do not admit any separation are called inseparable. We apply the theory to the edge ring of a finite graph. The coordinate ring of a convex polyomino may be viewed as the edge ring of a special class of bipartite graphs. It is shown that the coordinate ring of any convex polyomino is inseparable. We introduce the concept of semi-rigidity, and give a combinatorial description of the graphs whose edge ring is semi-rigid. The results are applied to show that for $m-k=k=3$, $G_{k,m-k}$ is not rigid while for $m-k\geq k\geq 4$, $G_{k,m-k}$ is rigid. Here $G_{k,m-k}$ is the complete bipartite graph $K_{m-k,k}$ with one edge removed.Comment: 33 pages, chapter 2 of the Book << Multigraded Algebra and Applications>> 2018, Springer International Publishing AG, part of Springer Natur

Saturation numbers in tripartite graphs

Given graphs $H$ and $F$, a subgraph $G\subseteq H$ is an $F$-saturated subgraph of $H$ if $F\nsubseteq G$, but $F\subseteq G+e$ for all $e\in E(H)\setminus E(G)$. The saturation number of $F$ in $H$, denoted $\text{sat}(H,F)$, is the minimum number of edges in an $F$-saturated subgraph of $H$. In this paper we study saturation numbers of tripartite graphs in tripartite graphs. For $\ell\ge 1$ and $n_1$, $n_2$, and $n_3$ sufficiently large, we determine $\text{sat}(K_{n_1,n_2,n_3},K_{\ell,\ell,\ell})$ and $\text{sat}(K_{n_1,n_2,n_3},K_{\ell,\ell,\ell-1})$ exactly and $\text{sat}(K_{n_1,n_2,n_3},K_{\ell,\ell,\ell-2})$ within an additive constant. We also include general constructions of $K_{\ell,m,p}$-saturated subgraphs of $K_{n_1,n_2,n_3}$ with few edges for $\ell\ge m\ge p>0$.Comment: 18 pages, 6 figure