Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.05752

Hypergraph matchings and designs

Peter Keevash
View original source ↗Read source document ↗Export metadata ↓

Abstract

We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Keevash. 2018-07-16. Hypergraph matchings and designs. https://arxiv.org/abs/1807.05752

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Transience of walks in the countable complete digraph with complex edge weights

We extend a fragment of the symbolic method in enumerative combinatorics by allowing coefficients in generating functions to be defined by infinite series and generalize Pólya's theorem on random walks. Pólya's theorem determines limits of the probabilities that walks in the grid graph on $\mathbb{Z}^d$, starting at the origin $\overline{0}$, visit the given vertex $\overline{v}$. We generalize the grid graph to the countable complete directed graph $\vec{K}_{\mathbb{N}}$ on the vertices $\mathbb{N}=\{1,2,\dots\}$ and weight its edges by complex numbers. We obtain 16 generalizations of Pólya's theorem. Our approach, in fact, generalizes Markov chains on $\mathbb{N}$ starting at $1$.

math.CO↗
arXiv2026

Integral quasi-strongly regular Cayley graphs

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $Γ_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include a sufficient condition for $Γ_H(G)$ to be integral and an explicit computation of its entire spectrum when $H$ is normal, revealing that the spectrum in this case depends only on $|G|$ and the index $[G:H]$.

math.CO↗
arXiv2026

Efficient total facial coloring of combinatorial maps

Let $1<k\in\mathbb{Z}$. A total coloring of a connected simple regular graph $G$ via color set $]k]_0=\{0,1,\ldots, k\}$ is efficient if each color yields an efficient dominating set, where efficient domination applies to each color class in $V(G)$. An efficient total coloring of $G$ via $[k]_0$ extends to an efficient total facial coloring $c$ of a map $M(G)$ of $G$ if it assigns a vertex-and-edge $k$-color set to the boundary cycle of each face, with the consequently missing color assigned to the face itself, so that the two adjacent faces along each edge are assigned different colors. Focus is set upon planar and toroidal maps. Modifications of $c$ are also treated by removing a perfect dominating set or a 1-factor from $G$.

math.CO↗