Related papers: A recursive theta body for hypergraphs

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

We provide an upper bound to the number of graph homomorphisms from $G$ to $H$, where $H$ is a fixed graph with certain properties, and $G$ varies over all $N$-vertex, $d$-regular graphs. This result generalizes a recently resolved…

We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for graphs. It preserves the dimension of a subbasis, cohomology and Euler characteristic. Connectivity and homotopy look as in classical…

Lovasz's striking proof of Kneser's conjecture from 1978 using the Borsuk--Ulam theorem provides a lower bound on the chromatic number of a graph. We introduce the shore subdivision of simplicial complexes and use it to show an upper bound…

A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties, most of them related to their defect which is the number…

We use the hypergraph container theory of Balogh--Morris--Samotij and Saxton--Thomason to obtain general rectilinear approximations and volume estimates for sequences of bodies closed under certain families of projections. We give a number…

The problem of uniformly sampling hypergraph independent sets is revisited. We design an efficient perfect sampler for the problem under a condition similar to that of the asymmetric Lov\'asz Local Lemma. When applied to $d$-regular…

Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…

In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asymptotic formulae for the number of connected $r$-uniform…

A Berge copy of a graph is a hypergraph obtained by enlarging the edges arbitrarily. Gr\'osz, Methuku and Tompkins in 2020 showed that for any graph $F$, there is an integer $r_0=r_0(F)$, such that for any $r\ge r_0$, any $r$-uniform…

We exhibit the first examples of hyperbolic three-manifolds for which the Seiberg-Witten equations do not admit any irreducible solution. Our approach relies on hyperbolic geometry in an essential way; it combines an explicit upper bound…

We study the length spectrum of a model of random hyperbolic 3-manifolds introduced by Petri and Raimbault. These are compact manifolds with boundary constructed by randomly gluing truncated tetrahedra along their faces. We prove that, as…

For a graph $F$, a hypergraph $\mathcal{H}$ is a Berge copy of $F$ (or a Berge-$F$ in short), if there is a bijection $f : E(F) \rightarrow E(\mathcal{H})$ such that for each $e \in E(F)$ we have $e \subset f(e)$. A hypergraph is…

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

Let $\Delta$ be a hyperbolic triangle with a fixed area $\varphi$. We prove that for all but countably many $\varphi$, generic choices of $\Delta$ have the property that the group generated by the $\pi$--rotations about the midpoints of the…

A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties.…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

Given graphs $X$ and $Y$, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from $X$ to $Y$. By varying the cone, we obtain similar…

O'Donnell, Wright, Wu and Zhou [SODA 2014] introduced the notion of robustly asymmetric graphs. Roughly speaking, these are graphs in which for every $0 \le \rho \le 1$, every permutation that permutes a $\rho$ fraction of the vertices maps…