Hypergraphs[ExampleHypergraphs]
Kuratowski
Return a random hypergraph of given order and size
Calling Sequence
Parameters
Description
Examples
References
Compatibility
Kuratowski(S,r)
S
-
set
r
posint
The command Kuratowski(S,r) returns the Kuratowski hypergraph on S, that is, the hypergraph K whose vertex set is S whose hyperedges are the subsets of S with exactly r elements.
Assumptions
The integer r must be less or equal to n, where n is the cardinality of S. Otherwise, an error is raised.
with⁡Hypergraphs:with⁡ExampleHypergraphs:
Consider the following Kuratowski hypergraph.
K3≔Kuratowski⁡1,2,3,4,5,3
K3≔< a hypergraph on 5 vertices with 10 hyperedges >
Draw a graphical representation of this hypergraph.
Draw⁡K3
Observe that K3 is its own transversal.
AreEqual⁡Transversal⁡K3,K3
true
Consider these two Kuratowski hypergraphs.
K2≔Kuratowski⁡1,2,3,4,5,2;K4≔Kuratowski⁡1,2,3,4,5,4
K2≔< a hypergraph on 5 vertices with 10 hyperedges >
K4≔< a hypergraph on 5 vertices with 5 hyperedges >
Draw a graphical representation of K2.
Draw⁡K2
Draw a graphical representation of K4.
Draw⁡K4
Observe that K2 is the transversal hypergraph of K4.
T≔Transversal⁡K2;AreEqual⁡T,K4
T≔< a hypergraph on 5 vertices with 5 hyperedges >
Observe that K4 is the transversal hypergraph of K2.
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[ExampleHypergraphs][Kuratowski] command was introduced in Maple 2024.
For more information on Maple 2024 changes, see Updates in Maple 2024.
See Also
Hypergraphs[Transversal]
Download Help Document