📣 XGI v1.0 is here!!
A Python library for higher-order networks: model, analyze, and visualize hypergraphs, directed hypergraphs, and simplicial complexes.
Stats, generators, drawing, I/O, datasets, all in one place.
🔗 xgi.readthedocs.io
📦 pip install xgi
1/
A Python library for higher-order networks: model, analyze, and visualize hypergraphs, directed hypergraphs, and simplicial complexes.
Stats, generators, drawing, I/O, datasets, all in one place.
🔗 xgi.readthedocs.io
📦 pip install xgi
1/
November 5, 2026 at 2:55 PM
📣 XGI v1.0 is here!!
A Python library for higher-order networks: model, analyze, and visualize hypergraphs, directed hypergraphs, and simplicial complexes.
Stats, generators, drawing, I/O, datasets, all in one place.
🔗 xgi.readthedocs.io
📦 pip install xgi
1/
A Python library for higher-order networks: model, analyze, and visualize hypergraphs, directed hypergraphs, and simplicial complexes.
Stats, generators, drawing, I/O, datasets, all in one place.
🔗 xgi.readthedocs.io
📦 pip install xgi
1/
Elham Mehdi-Nezhad: Isomorphisms and automorphisms of minimal comaximal hypergraphs of commutative rings https://arxiv.org/abs/2611.07992 https://arxiv.org/pdf/2611.07992 https://arxiv.org/html/2611.07992
November 6, 2026 at 6:46 AM
Elham Mehdi-Nezhad: Isomorphisms and automorphisms of minimal comaximal hypergraphs of commutative rings https://arxiv.org/abs/2611.07992 https://arxiv.org/pdf/2611.07992 https://arxiv.org/html/2611.07992
Lihua Wei, Kexiang Xu: Ore-degree conditions for matchings in uniform hypergraphs https://arxiv.org/abs/2611.09064 https://arxiv.org/pdf/2611.09064 https://arxiv.org/html/2611.09064
November 9, 2026 at 6:47 AM
Lihua Wei, Kexiang Xu: Ore-degree conditions for matchings in uniform hypergraphs https://arxiv.org/abs/2611.09064 https://arxiv.org/pdf/2611.09064 https://arxiv.org/html/2611.09064
Elham Mehdi-Nezhad
Isomorphisms and automorphisms of minimal comaximal hypergraphs of commutative rings
https://arxiv.org/abs/2611.07992
Isomorphisms and automorphisms of minimal comaximal hypergraphs of commutative rings
https://arxiv.org/abs/2611.07992
November 6, 2026 at 7:06 AM
Elham Mehdi-Nezhad
Isomorphisms and automorphisms of minimal comaximal hypergraphs of commutative rings
https://arxiv.org/abs/2611.07992
Isomorphisms and automorphisms of minimal comaximal hypergraphs of commutative rings
https://arxiv.org/abs/2611.07992
Liping Zhang, Ailian Chen, Qinghai Liu: P\'osa-type resilience for Hamilton Berge cycles in random hypergraphs https://arxiv.org/abs/2611.08525 https://arxiv.org/pdf/2611.08525 https://arxiv.org/html/2611.08525
November 9, 2026 at 6:46 AM
Liping Zhang, Ailian Chen, Qinghai Liu: P\'osa-type resilience for Hamilton Berge cycles in random hypergraphs https://arxiv.org/abs/2611.08525 https://arxiv.org/pdf/2611.08525 https://arxiv.org/html/2611.08525
Chunli Deng, Shaohuan Hao, Haifeng Li: On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs https://arxiv.org/abs/2611.09357 https://arxiv.org/pdf/2611.09357 https://arxiv.org/html/2611.09357
November 9, 2026 at 6:47 AM
Chunli Deng, Shaohuan Hao, Haifeng Li: On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs https://arxiv.org/abs/2611.09357 https://arxiv.org/pdf/2611.09357 https://arxiv.org/html/2611.09357
4/ XGI v1.0 in numbers: 5 years, 27 contributors, and countless issues, PRs and Zulip threads. Huge thanks to maintainers and every contributor who filed an issue, pushed a PR, or showed up in Zulip. Try it, break it, tell us what we missed.
#NetworkScience #Python #Hypergraphs
#NetworkScience #Python #Hypergraphs
The Office: Michael Scott Bows and Says Thank You
ALT: The Office: Michael Scott Bows and Says Thank You
static.klipy.com
November 5, 2026 at 2:55 PM
4/ XGI v1.0 in numbers: 5 years, 27 contributors, and countless issues, PRs and Zulip threads. Huge thanks to maintainers and every contributor who filed an issue, pushed a PR, or showed up in Zulip. Try it, break it, tell us what we missed.
#NetworkScience #Python #Hypergraphs
#NetworkScience #Python #Hypergraphs
Jun Yue: Three-critical hypergraphs of maximum local edge connectivity two https://arxiv.org/abs/2611.07856 https://arxiv.org/pdf/2611.07856 https://arxiv.org/html/2611.07856
November 6, 2026 at 6:47 AM
Jun Yue: Three-critical hypergraphs of maximum local edge connectivity two https://arxiv.org/abs/2611.07856 https://arxiv.org/pdf/2611.07856 https://arxiv.org/html/2611.07856
Heng Li, Xizhi Liu: Hypergraphs with zero uniform Tur\'an density at intermediate levels https://arxiv.org/abs/2611.06964 https://arxiv.org/pdf/2611.06964 https://arxiv.org/html/2611.06964
November 6, 2026 at 6:46 AM
Heng Li, Xizhi Liu: Hypergraphs with zero uniform Tur\'an density at intermediate levels https://arxiv.org/abs/2611.06964 https://arxiv.org/pdf/2611.06964 https://arxiv.org/html/2611.06964
Arpita Das, Debjit Ghosal: Constructing Cospectral Hypergraphs Using Adjacency Preserving Permutations https://arxiv.org/abs/2611.06199 https://arxiv.org/pdf/2611.06199 https://arxiv.org/html/2611.06199
November 5, 2026 at 6:47 AM
Arpita Das, Debjit Ghosal: Constructing Cospectral Hypergraphs Using Adjacency Preserving Permutations https://arxiv.org/abs/2611.06199 https://arxiv.org/pdf/2611.06199 https://arxiv.org/html/2611.06199
Arnab Chaterjee, Asaf Ferber, Marcelo Sales, Mason Shurman: Almost All 3-uniform Hypergraphs are Class 1 https://arxiv.org/abs/2611.05622 https://arxiv.org/pdf/2611.05622 https://arxiv.org/html/2611.05622
November 5, 2026 at 6:46 AM
Arnab Chaterjee, Asaf Ferber, Marcelo Sales, Mason Shurman: Almost All 3-uniform Hypergraphs are Class 1 https://arxiv.org/abs/2611.05622 https://arxiv.org/pdf/2611.05622 https://arxiv.org/html/2611.05622
Raina Mary Thomas, Yasmeen Akhtar: Infinitely Many Almost-Uniform 3-Qualitative Independence Hypergraphs are Cores https://arxiv.org/abs/2611.04384 https://arxiv.org/pdf/2611.04384 https://arxiv.org/html/2611.04384
November 4, 2026 at 6:47 AM
Raina Mary Thomas, Yasmeen Akhtar: Infinitely Many Almost-Uniform 3-Qualitative Independence Hypergraphs are Cores https://arxiv.org/abs/2611.04384 https://arxiv.org/pdf/2611.04384 https://arxiv.org/html/2611.04384
Xianghe Zhu, Wenkai Xu, Gesine Reinert: Approximating Distributions on Vertex Degrees in Random Hypergraphs via Stein's Method https://arxiv.org/abs/2611.04705 https://arxiv.org/pdf/2611.04705 https://arxiv.org/html/2611.04705
November 4, 2026 at 6:51 AM
Xianghe Zhu, Wenkai Xu, Gesine Reinert: Approximating Distributions on Vertex Degrees in Random Hypergraphs via Stein's Method https://arxiv.org/abs/2611.04705 https://arxiv.org/pdf/2611.04705 https://arxiv.org/html/2611.04705
My Arity Science work began in 2020 and grew into a John Templeton Foundation-funded project. I’m now finalizing its original directions on my own: arity.science
Major directions continue at the Multi-History Science HyperSeminar, from 6 Nov: youtube.com/@MultiHistoryScience
Major directions continue at the Multi-History Science HyperSeminar, from 6 Nov: youtube.com/@MultiHistoryScience
Arity Science: Compositional Structure of Higher-Order Systems
Arity Science: a multi-project research programme on the compositional structure of higher-order systems: n-ary algebras, hypergraphs and higher-arity categories.
arity.science
November 5, 2026 at 11:07 AM
My Arity Science work began in 2020 and grew into a John Templeton Foundation-funded project. I’m now finalizing its original directions on my own: arity.science
Major directions continue at the Multi-History Science HyperSeminar, from 6 Nov: youtube.com/@MultiHistoryScience
Major directions continue at the Multi-History Science HyperSeminar, from 6 Nov: youtube.com/@MultiHistoryScience
Yulin Chang, Jie Han, Patrick Morris, Lin Sun: Clique-factors in randomly perturbed hypergraphs https://arxiv.org/abs/2610.41340 https://arxiv.org/pdf/2610.41340 https://arxiv.org/html/2610.41340
November 2, 2026 at 6:47 AM
Yulin Chang, Jie Han, Patrick Morris, Lin Sun: Clique-factors in randomly perturbed hypergraphs https://arxiv.org/abs/2610.41340 https://arxiv.org/pdf/2610.41340 https://arxiv.org/html/2610.41340
V. S. Yarmus, Kh. P. Gnatenko: Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing https://arxiv.org/abs/2610.41678 https://arxiv.org/pdf/2610.41678 https://arxiv.org/html/2610.41678
November 2, 2026 at 7:00 AM
V. S. Yarmus, Kh. P. Gnatenko: Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing https://arxiv.org/abs/2610.41678 https://arxiv.org/pdf/2610.41678 https://arxiv.org/html/2610.41678
Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing
https://arxiv.org/pdf/2610.41678
V. S. Yarmus, Kh. P. Gnatenko.
https://arxiv.org/pdf/2610.41678
V. S. Yarmus, Kh. P. Gnatenko.
https://arxiv.org/abs/2610.41678
arXiv abstract link
arxiv.org
November 2, 2026 at 9:32 AM
Solving the MAX-$k$-CUT problem for hypergraphs with quantum computing
https://arxiv.org/pdf/2610.41678
V. S. Yarmus, Kh. P. Gnatenko.
https://arxiv.org/pdf/2610.41678
V. S. Yarmus, Kh. P. Gnatenko.
Ailian Chen, Yanqiang Liu: A Fan-Type Theorem for Hamiltonian Berge Cycles in 3-Uniform Hypergraphs https://arxiv.org/abs/2610.41577 https://arxiv.org/pdf/2610.41577 https://arxiv.org/html/2610.41577
November 2, 2026 at 6:47 AM
Ailian Chen, Yanqiang Liu: A Fan-Type Theorem for Hamiltonian Berge Cycles in 3-Uniform Hypergraphs https://arxiv.org/abs/2610.41577 https://arxiv.org/pdf/2610.41577 https://arxiv.org/html/2610.41577
Activity-based temporal hypergraphs: from individual activity to collective social dynamics arxiv.org/abs/2610.36333
Activity-based temporal hypergraphs: from individual activity to collective social dynamics
Temporal hypergraphs provide an interesting representation for many social systems, as they integrate both the temporal and group nature of social interactions. Designing models of time-varying hyper-...
arxiv.org
October 29, 2026 at 9:38 AM
Activity-based temporal hypergraphs: from individual activity to collective social dynamics arxiv.org/abs/2610.36333
David James, Bernard Lidick\'y, Dhruv Mubayi: Weighted Tur\'an densities for hypergraphs https://arxiv.org/abs/2610.39085 https://arxiv.org/pdf/2610.39085 https://arxiv.org/html/2610.39085
October 30, 2026 at 6:47 AM
David James, Bernard Lidick\'y, Dhruv Mubayi: Weighted Tur\'an densities for hypergraphs https://arxiv.org/abs/2610.39085 https://arxiv.org/pdf/2610.39085 https://arxiv.org/html/2610.39085
Martin Balko, Jelena Gli\v{s}i\'c: On edge-ordered Ramsey numbers of hypergraphs https://arxiv.org/abs/2610.39653 https://arxiv.org/pdf/2610.39653 https://arxiv.org/html/2610.39653
October 30, 2026 at 6:47 AM
Martin Balko, Jelena Gli\v{s}i\'c: On edge-ordered Ramsey numbers of hypergraphs https://arxiv.org/abs/2610.39653 https://arxiv.org/pdf/2610.39653 https://arxiv.org/html/2610.39653
Wanna have your science-loving mind blown? 🤯 Try molecular hypergraphs!
www.chemistryworld.com/opinion/stop...
www.chemistryworld.com/opinion/stop...
Stop drawing lies: Why chemistry needs hypergraphs
Guillermo Restrepo reflects on the limitations of how we currently draw molecules and calls on chemists to adopt a system that better illustrates their complexity
www.chemistryworld.com
October 28, 2026 at 3:37 PM
Wanna have your science-loving mind blown? 🤯 Try molecular hypergraphs!
www.chemistryworld.com/opinion/stop...
www.chemistryworld.com/opinion/stop...
Amey Bhangale, Krishna Priya KM, Simon Rubin-Toles: Hardness of Coloring $2$-Colorable $3$-Uniform Hypergraphs with $\log^{\Omega(1)} n$ Colors https://arxiv.org/abs/2610.37869 https://arxiv.org/pdf/2610.37869 https://arxiv.org/html/2610.37869
October 30, 2026 at 6:43 AM
Amey Bhangale, Krishna Priya KM, Simon Rubin-Toles: Hardness of Coloring $2$-Colorable $3$-Uniform Hypergraphs with $\log^{\Omega(1)} n$ Colors https://arxiv.org/abs/2610.37869 https://arxiv.org/pdf/2610.37869 https://arxiv.org/html/2610.37869
Spoiler: chemistry *doesn't* need hypergraphs.
There’s a moment in every chemist’s life when you realise you’ve been told fairytales. Maybe one turning point, maybe a series of small realisations throughout your education.
Guillermo Restrepo reflects on one such example: how we draw molecules.
#ChemSky
www.chemistryworld.com/opinion/stop...
Guillermo Restrepo reflects on one such example: how we draw molecules.
#ChemSky
www.chemistryworld.com/opinion/stop...
October 26, 2026 at 6:51 PM
Spoiler: chemistry *doesn't* need hypergraphs.