English
Related papers

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

200 papers

This survey describes some useful properties of the local homology of abstract simplicial complexes. Although the existing literature on local homology is somewhat dispersed, it is largely dedicated to the study of manifolds, submanifolds,…

For positive integers $n$ and $k$ with $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph with vertex set consisting of all $k$-sets of $\{1,\dots,n\}$, where two $k$-sets are adjacent exactly when they are disjoint. The independent sets…

Combinatorics · Mathematics 2022-06-08 József Balogh , Robert A. Krueger , Haoran Luo

We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…

Discrete Mathematics · Computer Science 2020-12-04 Zohre Ranjbar-Mojaveri , Andras Farago

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

Combinatorics · Mathematics 2026-05-15 Sally Cockburn , Ryhory Hatavets , Will Swartz

A key feature of Simonovits' proof of the classic Erd\H{o}s-P\'osa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to $A$-paths. With it we deduce a…

Combinatorics · Mathematics 2018-01-24 Henning Bruhn , Matthias Heinlein , Felix Joos

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

Combinatorics · Mathematics 2017-07-31 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya J. Stein , Endre Szemerédi

We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic…

Algebraic Topology · Mathematics 2025-06-04 Jeremy Miller , Peter Patzt , Dan Petersen , Oscar Randal-Williams

In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…

Algebraic Topology · Mathematics 2024-09-02 Shiquan Ren

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

Algebraic Topology · Mathematics 2007-05-23 Marco Grandis

We show that we can assume graphs that do not have the edge-Erd\H{o}s-P\'{o}sa property to be connected. Then we strengthen this result to $2$-connectivity under the additional assumptions of a minor-closed property and a generic…

Combinatorics · Mathematics 2023-07-24 Raphael Steck

This paper focuses on extensions of the classic Erd\H{o}s-Gallai Theorem for the set of weighted function of each edge in a graph. The weighted function of an edge $e$ of an $n$-vertex uniform hypergraph $\mathcal{H}$ is defined to a…

Combinatorics · Mathematics 2024-04-02 Kai Zhao , Xiao-Dong Zhang

Let $\mathcal{A}$ be a family of subsets of a finite set. A subfamily of $\mathcal{A}$ is said to be intersecting when any two of its members contain at least one common element. We say that $\mathcal{A}$ is an Erd{\H o}s-Ko-Rado (EKR)…

Combinatorics · Mathematics 2025-10-17 J. B. Ebrahimi , A. Taherkhani

In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let $G=(V,E)$ be a primitive strongly regular graph with parameters $(v,k,\lambda,\mu)$. Let $S(G,H)$ be the graph from $G$ by switching with…

Combinatorics · Mathematics 2010-01-08 Hiroshi Nozaki

Consider a graph $G$ and a $k$-uniform hypergraph $\mathcal{H}$ on common vertex set $[n]$. We say that $\mathcal{H}$ is $G$-intersecting if for every pair of edges in $X,Y \in \mathcal{H}$ there are vertices $x \in X$ and $y \in Y$ such…

Combinatorics · Mathematics 2016-05-25 Tom Bohman , Ryan R. Martin

Let E be a transitive Courant algebroid with scalar product of neutral signature. A generalized almost complex structure \mathcal J on E is a skew-symmetric smooth field of endomorphisms of E which squares to minus the identity. We say that…

Differential Geometry · Mathematics 2025-01-08 Vicente Cortés , Liana David

We introduce a generalization of the notion of operad that we call a contractad, whose set of operations is indexed by connected graphs and whose composition rules are numbered by contractions of connected subgraphs. We show that many…

Algebraic Topology · Mathematics 2024-07-24 Denis Lyskov

We prove quantum ergodicity for certain orthonormal bases of $L^2(\mathbb{S}^2)$, consisting of joint eigenfunctions of the Laplacian on $\mathbb{S}^2$ and the discrete averaging operator over a finite set of rotations, generating a free…

Spectral Theory · Mathematics 2017-05-22 Shimon Brooks , Etienne Le Masson , Elon Lindenstrauss

Our first main result is a uniform bound, in every dimension $k \in \mathbb N$, on the topological Tur\'an numbers of $k$-dimensional simplicial complexes: for each $k \in \mathbb N$, there is a $\lambda_k \ge k^{-2k^2}$ such that for any…

Combinatorics · Mathematics 2022-07-07 Jason Long , Bhargav Narayanan , Corrine Yap

Erd\H{o}s-Ko-Rado (EKR) type theorems yield upper bounds on the sizes of families of sets, subject to various intersection requirements on the sets in the family. Stability versions of such theorems assert that if the size of a family is…

Combinatorics · Mathematics 2018-05-28 David Ellis , Nathan Keller , Noam Lifshitz