Skip to main content
MathOverflow

Return to Question

deleted 2 characters in body; edited tags
Source Link
LeechLattice
LeechLattice
  • 9.5k
  • 2
  • 23
  • 57

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 not contained in the same part. (All vertices must come from different parts)
  2. For all edges e, all vertices in e are not contained in the same part.

I found papers referring to each definition using the same term “k-partite hypergraph”. Here is what I wonder: Which one of those is more frequently used? I would like to refer to the second one in my article. Is it acceptable to call the second definition k-partite hypergraph, or is there another term for the second case?

Thank you.

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 not contained in the same part. (All vertices must come from different parts)
  2. For all edges e, all vertices in e are not contained in the same part.

I found papers referring to each definition using the same term “k-partite hypergraph”. Here is what I wonder: Which one of those is more frequently used? I would like to refer to the second one in my article. Is it acceptable to call the second definition k-partite hypergraph, or is there another term for the second case?

Thank you.

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 not contained in the same part. (All vertices must come from different parts)
  2. For all edges e, all vertices in e are not contained in the same part.

I found papers referring to each definition using the same term “k-partite hypergraph”. Here is what I wonder: Which one of those is more frequently used? I would like to refer to the second one in my article. Is it acceptable to call the second definition k-partite hypergraph, or is there another term for the second case?

Thank you.

Source Link
Boonpipop Sirirojrattana
Boonpipop Sirirojrattana
  • 11
  • 1

Definition of k-partite hypergraph

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 not contained in the same part. (All vertices must come from different parts)
  2. For all edges e, all vertices in e are not contained in the same part.

I found papers referring to each definition using the same term “k-partite hypergraph”. Here is what I wonder: Which one of those is more frequently used? I would like to refer to the second one in my article. Is it acceptable to call the second definition k-partite hypergraph, or is there another term for the second case?

Thank you.