Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2025-06-22 22:55:54 +0200 | received badge | ● Popular Question (source) |
| 2025-06-17 16:15:15 +0200 | received badge | ● Nice Question (source) |
| 2025-06-08 10:50:01 +0200 | received badge | ● Supporter (source) |
| 2025-06-05 20:19:52 +0200 | received badge | ● Student (source) |
| 2025-06-04 12:34:25 +0200 | edited question | Restricted matchings in simplicial complexes or graphs Restricted matchings in simplicial complexes or graphs Let $\Delta$ be a simplicial complex. Let $F, G \in \mathcal{F}(\ |
| 2025-06-04 12:32:53 +0200 | asked a question | Restricted matchings in simplicial complexes or graphs Restricted matchings in simplicial complexes or graphs Let $\Delta$ be a simplicial complex. Let $F, G \in \mathcal{F}(\ |
| 2025-05-22 21:48:26 +0200 | edited question | Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices A hypergraph is called totally |
| 2025-05-21 14:56:29 +0200 | commented question | Obtaining Betti numbers in Sage Look here |
| 2025-05-21 11:56:28 +0200 | commented answer | Output of RootedTrees() Thank you! I really appreciated |
| 2025-05-21 11:56:11 +0200 | commented answer | Output of RootedTrees() Thank you! I really appreciated |
| 2025-05-21 11:55:37 +0200 | commented question | Output of RootedTrees() I knew its name was "HashTable" from Macaulay2 language. Thank you for your clarification |
| 2025-05-21 11:54:22 +0200 | edited question | Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices A facet $F$ of a simplicial co |
| 2025-05-21 11:53:27 +0200 | asked a question | Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices A facet $F$ of a simplicial co |
| 2025-05-13 22:58:49 +0200 | commented question | Output of RootedTrees() For instance, the HashTable of G with V(G)={1,2,3,4,5} and E(G)={{1,2},{1,3},{1,4},{1,5}} is { 1 => {2,3,4,5}, 2 =&g |
| 2025-05-13 22:58:36 +0200 | commented question | Output of RootedTrees() For instance, the HashTable of G with V(G)={1,2,3,4,5} and E(G)={{1,2},{1,3},{1,4},{1,5}} is { 1 => {1,2,3,4,5}, 2 = |
| 2025-05-13 22:56:47 +0200 | received badge | ● Editor (source) |
| 2025-05-13 22:56:47 +0200 | edited question | Output of RootedTrees() Output of RootedTrees() Dear all, I’m currently working on rooted trees and I wanted to ask if there is an alternative |
| 2025-05-13 19:13:25 +0200 | asked a question | Output of RootedTrees() Output of RootedTrees() Dear all, I’m currently working on rooted trees and I wanted to ask if there is an alternative |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.