Skip to main navigation Skip to search Skip to main content

The vertex sets of subtrees of a tree

Research output: Contribution to journalArticlepeer-review

Abstract

Let F be a set of subsets of a set W . When is there a tree T with vertex set W such that each member of F is the set of vertices of a subtree of T ? It is necessary that F has the Helly property and the intersection graph of F is chordal. We will show that these two necessary conditions are together sufficient in the finite case, and more generally, they are sufficient if no element of W belongs to infinitely many infinite sets in F.

Original languageEnglish (US)
Article numberP2.7
JournalElectronic Journal of Combinatorics
Volume33
Issue number2
DOIs
StatePublished - 2026

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The vertex sets of subtrees of a tree'. Together they form a unique fingerprint.

Cite this