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 bipartite.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
