We present several results in extremal graph and hypergraph theory of topological nature. First, we show that if $α>0$ and $\ell=Ω(\frac{1}α\log\frac{1}α)$ is an odd integer, then every graph $G$ with $n$ vertices and at least $n^{1+α}$ edges contains an $\ell$-subdivision of the complete graph $K_t$, where $t=n^{Θ(α)}$. Also, this remains true if in addition the edges of $G$ are properly colored, and one wants to find a rainbow copy of such a subdivision. In the sparser regime, we show that properly edge colored graphs on $n$ vertices with average degree $(\log n)^{2+o(1)}$ contain rainbow cycles, while average degree $(\log n)^{6+o(1)}$ guarantees rainbow subdivisions of $K_t$ for any fixed $t$, thus improving recent results of Janzer and Jiang et al., respectively. Furthermore, we consider certain topological notions of cycles in pure simplicial complexes (uniform hypergraphs). We show that if $G$ is a $2$-dimensional pure simplicial complex ($3$-graph) with $n$ $1$-dimensional and at least $n^{1+α}$ 2-dimensional faces, then $G$ contains a triangulation of the cylinder and the Möbius strip with $O(\frac{1}α\log\frac{1}α)$ vertices. We present generalizations of this for higher dimensional pure simplicial complexes as well. In order to prove these results, we consider certain (properly edge colored) graphs and hypergraphs $G$ with strong expansion. We argue that if one randomly samples the vertices (and colors) of $G$ with not too small probability, then many pairs of vertices are connected by a short path whose vertices (and colors) are from the sampled set, with high probability.
We show that for any integer $t\geq 2$, every properly edge-coloured graph on $n$ vertices with more than $n^{1+o(1)}$ edges contains a rainbow subdivision of $K_t$. Note that this bound on the number of edges is sharp up to the $o(1)$ error term. This is a rainbow analogue of some classical results on clique subdivisions and extends some results on rainbow Turán numbers. Our method relies on the framework introduced by Sudakov and Tomon[2020] which we adapt to find robust expanders in the coloured setting.
Normaliz is an open-source software for the computation of lattice points in rational polyhedra, or, in a different language, the solutions of linear diophantine systems. The two main computational goals are (i) finding a system of generators of the set of lattice points and (ii) counting elements degree-wise in a generating function, the Hilbert Series. In the homogeneous case, in which the polyhedron is a cone, the set of generators is the Hilbert basis of the intersection of the cone and the lattice, an affine monoid. We will present some improvements to the Normaliz algorithm by subdividin…
Given a simplicial complex and a collection of subcomplexes covering it, the nerve theorem, a fundamental tool in topological combinatorics, guarantees a certain connectivity of the simplicial complex when connectivity conditions on the intersection of the subcomplexes are satisfied. We show that it is possible to extend this theorem by replacing some of these connectivity conditions on the intersection of the subcomplexes by connectivity conditions on their union. While this is interesting for its own sake, we use this extension to generalize in various ways the Meshulam lemma, a powerful hom…
We introduce canonical measures on a locally finite simplicial complex $K$ and study their asymptotic behavior under infinitely many barycentric subdivisions. We also compute the face polynomial of the asymptotic link and dual block of a simplex in the $d^{th}$ barycentric subdivision $Sd^d(K)$ of $K$, $d\gg0$. It is almost everywhere constant. When $K$ is finite, we study the limit face polynomial of $Sd^d(K)$ after F.Brenti-V.Welker and E.Delucchi-A.Pixton-L.Sabalka.
Let $K$ be a finite simplicial complex. We prove that the normalized expected Betti numbers of a random subcomplex in its $d$-th barycentric subdivision $\text{Sd}^d (K)$ converge to universal limits as $d$ grows to $+ \infty$. In codimension one, we use canonical filtrations of $\text{Sd}^d (K)$ to upper estimate these limits and get a monotony theorem which makes it possible to improve these estimates given any packing of disjoint simplices in $\text{Sd}^d (K)$. We then introduce a notion of tiling of simplicial complexes having the property that skeletons and barycentric subdivisions of til…
Let $F$ be a discrete Morse function on a simplicial complex $L$. We construct a discrete Morse function $Δ(F)$ on the barycentric subdivision $Δ(L)$. The constructed function $Δ(F)$ "behaves the same way" as $F$, i. e. has the same number of critical simplexes and the same gradient path structure.
We prove that any family $E_1, \ldots , E_{\lceil rn \rceil}$ of (not necessarily distinct) sets of edges in an $r$-uniform hypergraph, each having a fractional matching of size $n$, has a rainbow fractional matching of size $n$ (that is, a set of edges from distinct $E_i$'s which supports such a fractional matching). When the hypergraph is $r$-partite and $n$ is an integer, the number of sets needed goes down from $rn$ to $rn-r+1$. The problem solved here is a fractional version of the corresponding problem about rainbow matchings, which was solved by Drisko and by Aharoni and Berger in the c…
The interval subdivision Int$(Δ)$ of a simplicial complex $Δ$ was introduced by Walker. We give the complete combinatorial description of the entries of the transformation matrices from the $f$- and $h$-vectors of $Δ$ to the $f$- and $h$-vectors of Int$(Δ)$. We show that if $Δ$ has non-negative $h$-vector then the $h$-polynomial of its interval subdivision has only real roots. As a consequence, we prove the Charney-Davis conjecture for Int$(Δ)$, if $Δ$ has non-negative reciprocal $h$-vector.
The antiprism triangulation provides a natural way to subdivide a simplicial complex $Δ$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as the simplicial complex of chains of multi-pointed faces of $Δ$, from a combinatorial point of view, and by successively applying the antiprism construction, or balanced stellar subdivisions, on the faces of $Δ$, from a geometric point of view. This paper studies enumerative invariants associated to this triangulation, such as the transformation of the $h$-vector o…
The main object of this work is the top-dimensional Laplacian operator of a simplicial complex $K$. We study its spectral limiting behavior under a given non-trivial subdivision procedure $\text{div}$. It will be shown that in case $\text{div}$ satisfies a property we call inclusion-uniformity its spectrum converges to a universal limiting distribution only depending on the dimension of $K$. This class of subdivisions contains important special cases such as the edgewise subdivision $\text{esd}_r$ for $r\geq 2$ and dimension $d=2$ or the barycentric subdivision $\text{sd}$. This parallels a re…
An edge-colored graph $G$ is $k$-color connected if, between each pair of vertices, there exists a path using at least $k$ different colors. The $k$-color connection number of $G$, denoted by $cc_{k}(G)$, is the minimum number of colors needed to color the edges of $G$ so that $G$ is $k$-color connected. First, we prove that let $H$ be a subdivision of a connected graph $G$, then $cc_{k}(H)\leq cc_{k}(G)$. Second, we give sufficient conditions to guarantee that $cc_{k}(G)=k$ in terms of minimum degree and the number of edges for 2-connected graphs. As a byproduct, we show that almost all graph…
We consider 2-dimensional random simplicial complexes $Y$ in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex $S$ admits a topological embedding into $Y$ asymptotically almost surely. Namely, if in the procedure of the multi-parameter model, each $i$-dimensional simplex is taken independently with probability $p_i=p_i(n)$, from a set of $n$ vertices, then the threshold is $p_0 p_1^3 p_2^2 = \frac{1}{n}$. This threshold happens to coincide with the previously established thresholds for uniform hyperbolicity and tr…
We introduce a filtration on the simplicial homology of a finite simplicial complex X using bi-colourings of its vertices. This yields two dual homology theories closely related to discrete Morse matchings on X. We give an explicit expression for the associated graded object of these homologies when X is the matching complex of the Tait graph of a plane graph $G$, in terms of subgraphs determined by certain matchings on the dual of G. We then use one of these homologies, in the case where X is a graph, to define a conjecturally optimal dissimilarity pseudometric for graphs; we prove various re…
