Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
Questions tagged [hypergraph]
274 questions
2
votes
1 answer
$3$-uniform hypergraph with $n$ vertices and $O(n^{3/2})$ hyperedges
Suppose $H=(V,E)$ is a $3$-uniform hypergraph with $n$ vertices $V$ and $O(n^{3/2})$ hyperedges, $E.$
My question is: How many vertices do I need to delete to make sure all hyperedges are destroyed?
I can solve this problem by Pigeonhole principle…
Ken
- 397
- 1
- 7
1
vote
1 answer
a class of directed hypergraphs
I am interested in a certain class of directed hypergraphs, more precisely in the class of those hypergraphs each of whose hyperedges contain an even number of nodes (not necessarily the same even number for each hyperedge!), the half of which are…
Delio Mugnolo
- 3,318
0
votes
1 answer
Maximum number of hyperedges in a directed hypergraph
I need a formula for maximum number of hyperedges that a directed hypergraph with n vertices can have. Following point is an unresolved issues for me and it keeps coming back to my mind:
There are different definitions for hyperedges in directed…
0
votes
1 answer
Why not have many edges instead of one edge connecting to many nodes (in hypergraphs)
As a follow-up to What are the Applications of Hypergraphs, the linked article:
Learning with Hypergraphs: Clustering, Classification, and Embedding
Mentions this:
Let us consider a problem of grouping a collection of articles into different…
Lance
- 103