All Questions

The following theorem is a classical result (see [Alon and Spencer, The probabilistic method, 2nd ed., Theorem 1.2.2]): Theorem: Let $G$ be a graph on $n$ vertices with minimum degree $d$. Then $G$ ...

Let $H$ be a hypergraph and let $P_H$ denote its chromatic polynomial. I am interested in the best results interpreting $P_H(-1)$. I am interested both in the general case (which I think is hard) as ...

Let $\mathcal{H}=(S,\mathcal{X})$ be a hypergraph, where $S = \{ s_1, \ldots, s_n \}$, and $\mathcal{X} = \{ X_1, \ldots, X_m \}$. The dual hypergraph $\mathcal{H}^*$ of $\mathcal{H}$ is the ...

I would like to know the standard definition of k-partite hypergraph. There are two natural generalizations of k-partite graph to k-partite hypergraph: 1. For all edges e, any two vertices in e are ...

I was looking for an algorithm to calculate the shortest hyperpath in intuitionistic fuzzy hypergraphs and I found only this article (which propose two algorithms). Are there any others algorithms ...

all the basic products for graphs have been extended to hypergraphs[1]. is there a concept of a product of hypergraphs with the same vertex set? has this been studied? normally the hypergraph ...