相关论文: Simple containers for simple hypergraphs

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…

A set of containers for a hypergraph G is a collection of vertex subsets, such that for every independent (or, indeed, merely sparse) set in G there is some subset in the collection which contains it. No set in the collection should be…

We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…

The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…

Recently the breakthrough method of hypergraph containers, developed independently by Balogh, Morris, and Samotij as well as Saxton and Thomason, has been used to study sparse random analogs of a variety of classical problems from…

In a seminal work, K\"uhn, Osthus, Townsend, and Zhao used the hypergraph container method to determine the typical structure of oriented graphs and digraphs avoiding a fixed tournament or cycle. Their main tool, a container theorem for…

In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by…

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…

A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. For every integer $k$ and every graph $H$, we determine the computational complexity of $k$-Edge Colouring for $H$-free graphs.

We present a short and simple proof of the celebrated hypergraph container theorem of Balogh--Morris--Samotij and Saxton--Thomason. On a high level, our argument utilises the idea of iteratively taking vertices of largest degree from an…

We give an explicit simple construction for classifying spaces of maps obtained as hyperplane projections of immersions. We prove structure theorems for these classifying spaces.

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

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…

Let $V$ be a finite set. Let $\mathcal{K}$ be a simplicial complex with its vertices in $V$. In this paper, we discuss some differential calculus on $V$. We construct some constrained homology groups of $\mathcal{K}$ by using the…

Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of…

We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective…

We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.

We consider the problem of space-efficiently estimating the number of simplices in a hypergraph stream. This is the most natural hypergraph generalization of the highly-studied problem of estimating the number of triangles in a graph…

In this paper we are interested in decomposing a dihypergraph $\mathcal{H} = (V, \mathcal{E})$ into simpler dihypergraphs, that can be handled more efficiently. We study the properties of dihypergraphs that can be hierarchically decomposed…