Question

Is there research on graphs where the edges can connect more than two nodes?

Answer 1

Graph theory noob question: how is this different from a graph with a k clique that has identical edges connecting the vertices in that clique?

Answer 2

Directed graphs are basically binary relations (over a finite set). You can generalize to n-ary relations.

Answer 3

Simplicial complexes sounds like what you're thinking about

Answer 4

Seems like these objects have a simple isomorphism to bipartite graphs: one set of nodes are the nodes and the other are the hyperedges. Tons of stuff on bipartite graphs

Answer 5

A question on the side. What's different from an edge connecting to multiple nodes and an edge connecting to a single node that can store multiple values?

Answer 6

surely if a graph consists of edges only connects to 2 nodes, that's just a doubly linked list?

edit: apologies for asking a question on Reddit. downvote away

Answer 7

Good question OP, leaving a comment because an upvote didn't feel like enough.

​

Edit: downvote bots wtf?

Answer 8

No. These are called degree three (or greater) vertices. They are very common. Yes, lots of research on these.