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

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?
Directed graphs are basically binary relations (over a finite set). You can generalize to n-ary relations.
Simplicial complexes sounds like what you're thinking about
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
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?
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
Good question OP, leaving a comment because an upvote didn't feel like enough.

&#x200B;

Edit: downvote bots wtf?
No. These are called degree three (or greater) vertices. They are very common. Yes, lots of research on these.

0 like 0 dislike