相关论文: On Hypergraph Supports

Given a 3-hypergraph $H$, a subset $M$ of $V(H)$ is a module of $H$ if for each $e\in E(H)$ such that $e\cap M\neq\emptyset$ and $e\setminus M\neq\emptyset$, there exists $m\in M$ such that $e\cap M=\{m\}$ and for every $n\in M$, we have…

A hypergraph is linear if each pair of distinct vertices appears in at most one common edge. We say $\varGamma=(V,E)$ is an associated graph of a linear hypergraph $\mathcal{H}=(V, X)$ if for any $x\in X$, the induced subgraph…

For a hypergraph $H=(V,\mathcal E)$, a subfamily $\mathcal C\subseteq \mathcal E$ is called a cover of the hypergraph if $\bigcup\mathcal C=\bigcup\mathcal E$. A cover $\mathcal C$ is called minimal if each cover $\mathcal…

A graph $G$ is $H$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to $H$. Given a graph $H$, we present sufficient and necessary conditions for a graph $G$ such that $G/e$ is $H$-free for any edge $e$ in…

Hypergraphs are generalisation of graphs in which a hyperedge can connect any number of vertices. It can describe n-ary relationships and high-order information among entities compared to conventional graphs. In this paper, we study the…

Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…

Let $\mathcal{H}$ be a set of given connected graphs. A graph $G$ is said to be $\mathcal{H}$-free if $G$ contains no $H$ as an induced subgraph for any $H\in \mathcal{H}$. The graph $G$ is super-edge-connected if each minimum edge-cut…

A graph $G=(V,E)$ is $\gamma$-excellent if $V$ is a union of all $\gamma$-sets of $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be a set of all mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H}…

A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected…

For a graph $G$ and a set of graphs $\mathcal{H}$, we say that $G$ is {\em $\mathcal{H}$-free} if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Given an integer $P>0$, a graph $G$, and a set of graphs $\mathcal{F}$,…

We say that a hypergraph $\mathcal{H}$ contains a graph $H$ as a trace if there exists some set $S\subset V(\mathcal{H})$ such that $\mathcal{H}|_S=\{h\cap S: h\in E(\mathcal{H})\}$ contains a subhypergraph isomorphic to $H$. We study the…

Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A…

A bipartite graph $G=(A,B,E)$ is ${\cal H}$-convex, for some family of graphs ${\cal H}$, if there exists a graph $H\in {\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\in B$ induces a connected subgraph of $H$.…

While network science has become an indispensable tool for studying complex systems, the conventional use of pairwise links often shows limitations in describing high-order interactions properly. Hypergraphs, where each edge can connect…

A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$…

Counting small patterns in a large dataset is a fundamental algorithmic task. The most common version of this task is subgraph/homomorphism counting, wherein we count the number of occurrences of a small pattern graph $H$ in an input graph…

A hypergraph is a $T_0$-hypergraph if for every two different vertices of the hypergraph there exists an edge containing one of the vertices and not containing the other. A general method for the enumeration of certain classes of…

An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tree with maximum degree at most h is denoted by [h,2,1]. The…

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…

Hypergraphs are a powerful abstraction for modeling high-order relations, which are ubiquitous in many fields. A hypergraph consists of nodes and hyperedges (i.e., subsets of nodes); and there have been a number of attempts to extend the…