# \#discrete-mathematics

**URL:** https://discourse.julialang.org/tag/discrete-mathematics/1645.md

[Latest](https://discourse.julialang.org/latest.md) · [Categories](https://discourse.julialang.org/categories.md) · [Tags](https://discourse.julialang.org/tags.md)

---

## [Persistent vertex identities for Steiner tree, vertex removal](https://discourse.julialang.org/t/persistent-vertex-identities-for-steiner-tree-vertex-removal/119568)

<div class="topic-metadata">

**Author:** [@bremez](https://discourse.julialang.org/u/bremez)\
**Replies:** 7\
**Last updated:** [September 20, 2024, 2:32pm UTC](https://discourse.julialang.org/t/persistent-vertex-identities-for-steiner-tree-vertex-removal/119568 "2024-09-20T14:32:39Z")

</div>

I have a use case for a large graph, from which I iteratively remove vertices, and at each step compute some Steiner trees from its current state. Specifically, my use case requires to know to which vertices in the origi…

---

## [New package \`Posets\`](https://discourse.julialang.org/t/new-package-posets/117981)

<div class="topic-metadata">

**Author:** [@scheinerman](https://discourse.julialang.org/u/scheinerman)\
**Replies:** 8\
**Last updated:** [August 9, 2024, 4:33pm UTC](https://discourse.julialang.org/t/new-package-posets/117981 "2024-08-09T16:33:27Z")

</div>

Announcing a new package for working with partially ordered sets: Posets. This package is based on Julia Graphs both in terms of dependency and design philosophy. Posets is available now in the Julia registry and more …