Related papers: New linear invariants of hypergraphs

We determine the \emph{exact} minimum $\ell$-degree threshold for perfect matchings in $k$-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than $\frac{1}{2} \binom{n}{k- \ell}$.…

We define an invariant $\nabla_G(M)$ of pairs M,G, where M is a 3-manifold obtained by surgery on some framed link in the cylinder $S\times I$, S is a connected surface with at least one boundary component, and G is a fatgraph spine of S.…

Let $\mathfrak{g}$ be a semi-simple Lie algebra with fixed root system, and $U_q(\mathfrak{g})$ the quantization of its universal enveloping algebra. Let $\mathcal{S}$ be a subset of the simple roots of $\mathfrak{g}$. We show that the…

We give a unified method for the general equivalence problem of extrinsic geometry, on the basis of our formulation of a general extrinsic geometry as that of an osculating map $\varphi\colon (M,\mathfrak f) \to L/L^0 \subset…

We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for…

A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

The main goal of this article is to construct some geometric invariants for the topology of the set $\mathcal{F}$ of flat connections on a principal $G$-bundle $P\,\longrightarrow\, M$. Although the characteristic classes of principal…

As set systems, hypergraphs are omnipresent and have various representations ranging from Euler and Venn diagrams to contact representations. In a geometric representation of a hypergraph $H=(V,E)$, each vertex $v\in V$ is associated with a…

We prove that for integers $2 \leq \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability $p \geq…

The Tur\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\left({n;H} \right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let…

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

A $k$-uniform hypergraph $G=(V,E)$ is called odd-bipartite ([5]), if $k$ is even and there exists some proper subset $V_1$ of $V$ such that each edge of $G$ contains odd number of vertices in $V_1$. Odd-bipartite hypergraphs are…

Using contact-geometric techniques and sutured Floer homology, we present an alternate formulation of the minus and plus version of knot Floer homology. We further show how natural constructions in the realm of contact geometry give rise to…

A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…

We give some graph theoretical formulas for the trace $Tr_k(\mathbb {T})$ of a tensor $\mathbb {T}$ which do not involve the differential operators and auxiliary matrix. As applications of these trace formulas in the study of the spectra of…

In cut sparsification, all cuts of a hypergraph $H=(V,E,w)$ are approximated within $1\pm\epsilon$ factor by a small hypergraph $H'$. This widely applied method was generalized recently to a setting where the cost of cutting each hyperedge…

In this paper, based on the embedded homology groups of hypergraphs defined in \cite{h1}, we define the product of hypergraphs and prove the corresponding K\"{u}nneth formula of hypergraphs which can be generalized to the K\"{u}nneth…

Sutured Floer homology, denoted by SFH, is an invariant of balanced sutured manifolds previously defined by the author. In this paper we give a formula that shows how this invariant changes under surface decompositions. In particular, if…

Given a hypergraph $\mathcal{H}$ and a graph $G$, we say that $\mathcal{H}$ is a \textit{Berge}-$G$ if there is a bijection between the hyperedges of $\mathcal{H}$ and the edges of $G$ such that each hyperedge contains its image. We denote…