The command IsRegular(H) checks whether the hypergraph H is regular or not.

$\mathrm{with}\left(\mathrm{Hypergraphs}\right)\:$$\mathrm{with}\left(\mathrm{ExampleHypergraphs}\right)\:$

$H≔\mathrm{Hypergraph}\left(\left[1\,2\,3\,4\,5\,6\,7\right]\,\left[\left\{1\,2\,3\right\}\,\left\{2\,3\right\}\,\left\{4\right\}\,\left\{3\,5\,6\right\}\right]\right)$

$H≔\mathrm{<\; a\; hypergraph\; on\; 7\; vertices\; with\; 4\; hyperedges\; >}$

$\mathrm{Hypergraphs}:-\mathrm{Vertices}\left(H\right)\&semi;$$\mathrm{Hyperedges}\left(H\right)$

$\left[1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\&comma;7\right]$

$\left[\left\{4\right\}\&comma;\left\{2\&comma;3\right\}\&comma;\left\{1\&comma;2\&comma;3\right\}\&comma;\left\{3\&comma;5\&comma;6\right\}\right]$

$\mathrm{DegreeProfile}\left(H\right)$

$\left[1\&comma;2\&comma;3\&comma;1\&comma;1\&comma;1\&comma;0\right]$

$\mathrm{Rank}\left(H\right)\&semi;$$\mathrm{AntiRank}\left(H\right)$

$3$

$1$

$\mathrm{IsRegular}\left(H\right)$

$\mathrm{false}$

$\mathrm{IsUniform}\left(H\right)$

$\mathrm{false}$

$H≔\mathrm{Lovasz}\left(3\right)$

$H≔\mathrm{<\; a\; hypergraph\; on\; 6\; vertices\; with\; 10\; hyperedges\; >}$

$\mathrm{Hypergraphs}:-\mathrm{Vertices}\left(H\right)\&semi;$$\mathrm{Hyperedges}\left(H\right)$

$\left[1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\right]$

$\left[\left\{1\&comma;2\&comma;4\right\}\&comma;\left\{1\&comma;3\&comma;4\right\}\&comma;\left\{2\&comma;3\&comma;4\right\}\&comma;\left\{1\&comma;2\&comma;5\right\}\&comma;\left\{1\&comma;3\&comma;5\right\}\&comma;\left\{2\&comma;3\&comma;5\right\}\&comma;\left\{1\&comma;2\&comma;6\right\}\&comma;\left\{1\&comma;3\&comma;6\right\}\&comma;\left\{2\&comma;3\&comma;6\right\}\&comma;\left\{4\&comma;5\&comma;6\right\}\right]$

$\mathrm{DegreeProfile}\left(H\right)$

$\left[6\&comma;6\&comma;6\&comma;4\&comma;4\&comma;4\right]$

$\mathrm{Rank}\left(H\right)\&semi;$$\mathrm{AntiRank}\left(H\right)$

$3$

$3$

$\mathrm{IsRegular}\left(H\right)$

$\mathrm{false}$

$\mathrm{IsUniform}\left(H\right)$

$\mathrm{true}$

$H≔\mathrm{Kuratowski}\left(\left\{1\&comma;2\&comma;3\&comma;4\&comma;5\right\}\&comma;3\right)$

$H≔\mathrm{<\; a\; hypergraph\; on\; 5\; vertices\; with\; 10\; hyperedges\; >}$

$\mathrm{Hypergraphs}:-\mathrm{Vertices}\left(H\right)\&semi;$$\mathrm{Hyperedges}\left(H\right)$

$\left[1\&comma;2\&comma;3\&comma;4\&comma;5\right]$

$\left[\left\{1\&comma;2\&comma;3\right\}\&comma;\left\{1\&comma;2\&comma;4\right\}\&comma;\left\{1\&comma;3\&comma;4\right\}\&comma;\left\{2\&comma;3\&comma;4\right\}\&comma;\left\{1\&comma;2\&comma;5\right\}\&comma;\left\{1\&comma;3\&comma;5\right\}\&comma;\left\{2\&comma;3\&comma;5\right\}\&comma;\left\{1\&comma;4\&comma;5\right\}\&comma;\left\{2\&comma;4\&comma;5\right\}\&comma;\left\{3\&comma;4\&comma;5\right\}\right]$

$\mathrm{DegreeProfile}\left(H\right)$

$\left[6\&comma;6\&comma;6\&comma;6\&comma;6\right]$

$\mathrm{Rank}\left(H\right)\&semi;$$\mathrm{AntiRank}\left(H\right)$

$3$

$3$

$\mathrm{IsRegular}\left(H\right)$

$\mathrm{true}$

$\mathrm{IsUniform}\left(H\right)$

$\mathrm{true}$

Claude Berge. Hypergraphes. Combinatoires des ensembles finis. 1987,  Paris, Gauthier-Villars, translated to English.

Claude Berge. Hypergraphs. Combinatorics of Finite Sets.  1989, Amsterdam, North-Holland Mathematical Library, Elsevier, translated from French.

Charles Leiserson, Liyun Li, Marc Moreno Maza and Yuzhen Xie " Parallel computation of the minimal elements of a poset." Proceedings of the 4th International Workshop on Parallel Symbolic Computation (PASCO) 2010: 53-62, ACM.

The Hypergraphs[IsRegular] command was introduced in Maple 2024.

For more information on Maple 2024 changes, see Updates in Maple 2024.