Related papers: Erdos-Ko-Rado theorems for simplicial complexes

Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are…

The aim of this paper is to characterize simplicial complexes which have standard graded vertex cover algebras. This property has several nice consequences for the squarefree monomial ideals defining these algebras. It turns out that such…

The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…

Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…

In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a…

Let G be an arbitrary finite weighted digraph with weights in the set of complex rational functions. A general procedure is proposed which allows for the reduction of G to a smaller graph with a less complicated structure having the same…

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

In this paper, we show that both the general linear group $\gl{q}$ and the special linear group $\slg{q}$ have both the EKR property and the EKR-module property. This is done using an algebraic method; a weighted adjacency matrix for the…

Let $X$ be a normal geometrically connected variety over a finite field $\kappa$ of characteristic~$p$. Let $E$ be a number field. Using automorphic methods over global function fields, we derive properties of the geometric monodromy groups…

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

We study the geometric change of Chow cohomology classes in projective toric varieties under the Weil-McMullen dual of the intersection product with a Lefschetz element. Based on this, we introduce toric chordality, a generalization of…

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…

We prove the Dynamical Andr\'e-Oort (DAO) conjecture proposed by Baker and DeMarco for families of rational maps parameterized by an algebraic curve. In fact, we prove a stronger result, which is a Bogomolov type generalization of DAO for…

Crossed complexes are shown to have an algebra sufficiently rich to model the geometric inductive definition of simplices, and so to give a purely algebraic proof of the Homotopy Addition Lemma (HAL) for the boundary of a simplex. This…

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…