An Edge Path Tree (EPT) family is a family whose members are edge sets of paths in a tree. Relying on the notion of Pie introduced in [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B 38 (1985) 8-22], we characterize Ideal and Mengerian EPT families. In particular, we show that an EPT family is Ideal if and only if it is Mengerian. If, in addition, the EPT family is uniform, then it is Ideal if and only if it is Unimodular. The latter equivalence generalizes the well-known fact that the edge set of a graph is an Ideal clutter if and only if the graph is bipartite
Integrality properties of edge path tree families
Apollonio N
2009
Abstract
An Edge Path Tree (EPT) family is a family whose members are edge sets of paths in a tree. Relying on the notion of Pie introduced in [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B 38 (1985) 8-22], we characterize Ideal and Mengerian EPT families. In particular, we show that an EPT family is Ideal if and only if it is Mengerian. If, in addition, the EPT family is uniform, then it is Ideal if and only if it is Unimodular. The latter equivalence generalizes the well-known fact that the edge set of a graph is an Ideal clutter if and only if the graph is bipartiteFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
