Related papers: Invariant covers of multipartite hypergraphs
The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…
K\H onig's theorem says that the vertex cover number of every bipartite graph is at most its matching number (in fact they are equal since, trivially, the matching number is at most the vertex cover number). An equivalent formulation of K\H…
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…
Erd\H{o}s and Lov'asz asked whether there exists a "3-critical" 3-uniform hypergraph in which every vertex has degree at least 7. The original formulation does not specify what 3-critical means, and two non-equivalent notions have appeared…
Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph, the vertex cover number is at most $r{-}1$ times the matching number. This conjecture is only known to be true for $r\leq 3$ in general and for $r\leq 5$ if the…
Ozsvath and Szabo defined an analog of the Froyshov invariant in the form of a correction term for the grading in Heegaard Floer homology. Applying this to the double cover of the 3-sphere branched over a knot K, we obtain an invariant…
In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…
In this work, we prove that the universal and maximal abelian covers of a finite multi-graph have the same eigenvalues. This result strengthens a recent theorem of Li, Magee, Sabri, and Thomas (2025) and answers one of their questions. Our…
The Lichnerowicz conjecture asserts that all harmonic manifolds are either flat or locally symmetric spaces of rank 1. This conjecture has been proved by Z.I. Szabo for harmonic manifolds with compact universal cover. E. Damek and F. Ricci…
With the help of the theory of holomorphic and anti-holomorphic differentials, G. A. Jones [Chiral covers of hypermaps, Ars Math. Contemp. 8 (2015), 425-431] proved that every regular hypermap of a non-spherical type is covered by an…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor. Similarly, we provide a forbidden minor…
We study the existence of $L^2$ holomorphic sections of invariant line bundles over Galois coverings of Zariski open sets in Moishezon manilolds. We show that the von Neuman dimension of the space of $L^2$ holomorphic sections is bounded…
A well known problem from an excellent book of Lov\'asz states that any hypergraph with the property that no pair of hyperedges intersect in exactly one vertex can be properly 2-colored. Motivated by this as well as recent works of Keszegh…
We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…
In 1970, Chou showed there are $|\mathbb{N}^*| = 2^{2^\mathbb{N}}$ topologically invariant means on $L_\infty(G)$ for any noncompact, $\sigma$-compact amenable group. Over the following 25 years, the sizes of the sets of topologically…
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…
Let $n,k,s$ be three integers such that $k\geq 2$ and $n\geq s\geq 1$. Let $H$ be a $k$-partite $k$-uniform hypergraph with $n$ vertices in each class. Aharoni (2017) showed that if $e(H)>(s-1)n^{k-1}$, then $H$ has a matching of size $s$.…
Erd\H{o}s and Hajnal proved that every graph of uncountable chromatic number contains arbitrarily large finite, complete, bipartite graphs. We extend this result to hypergraphs.