Introduction to Hypergraphs [Graph Theory]

This video introduces hypergraphs with plenty of examples. We will cover terminology and basic properties of hypergraphs. Hypergraphs are a generalization of graphs, where edges are allowed to link more than 2 or fewer than 2 vertices at a time. There exist notions of degree, regularity, subgraphs, and adjacency in hypergraph theory just like in graph theory, and the concept of incidence is especially significant in the theory of hypergraphs. The concept of dual hypergraphs, which we cover at the end of the video, is also very significant in the study of hypergraphs, and will be revisited in future videos.

If you'd like to learn more about hypergraphs, I highly recommend these books and resources:
********************************* Hypergraph Books *********************************************

These are my Amazon Affiliate links. As an Amazon Associate I may earn commissions for purchases made through the links above.

********************************* Other Hypergraph Resources *********************************

Great discussion on Math Overflow:

[Channel-nubv]

Mindblowing! Ultra clear and helpful! Thanks a lot!

[klausprinoth]

Awesome video! Great explanation on stuff I never heard about.

[TwentyNineJP]

I just came across the concept of hypergraphs yesterday, and I think they're exactly the solution I've been looking for for project I've been stuck on

[RadhaKrishnan-rupy]

This videos help me to understand very easly this concept 🎉🎉

[RadhaKrishnan-rupy]

Thanqq.... So much sir your attempt help me to complete my project successfuly.... Thanks alode❤❤

[amitozazad]

Nice effort man, kudos ! At 2:29: (what vertices are incident to edge e3?) shouldn't it be a, c, d, e ? As I see that e3 circles around these 4 vertices, right ?

[rimbika]

Please explain Eulerian and Hamiltonian graph using the concept of hyper graph

[prathamkolhe]

Can you please share your PPT's for reference ?
Thanks for the video !!

[navneetsinha]

I want to create a hypergraph in Python which contains 100s of nodes, and user defined edges. Is it possible to do this ?

[kipling]

Fell at the first post. Can’t you just describe something in simple language for the non-mathematician? Vertices? Edges?