Finite Sholander trees, trees, and their betweenness
From MaRDI portal
Publication:641185
DOI10.1016/J.DISC.2011.06.011zbMATH Open1235.05029arXiv1101.2957OpenAlexW2054709282MaRDI QIDQ641185FDOQ641185
Authors: Vašek Chvátal, Dieter Rautenbach, Philipp M. Schäfer 
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: We provide a proof of Sholander's claim (Trees, lattices, order, and betweenness, Proc. Amer. Math. Soc. 3, 369-381 (1952)) concerning the representability of collections of so-called segments by trees, which yields a characterization of the interval function of a tree. Furthermore, we streamline Burigana's characterization (Tree representations of betweenness relations defined by intersection and inclusion, Mathematics and Social Sciences 185, 5-36 (2009)) of tree betweenness and provide a relatively short proof.
Full work available at URL: https://arxiv.org/abs/1101.2957
Recommendations
- Betweenness spaces and tree algebras
- Axiomatic characterization of the interval function of a block graph
- Représentations en arbre de proximités relatives
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- Characterization and representation problems for intersection betweennesses
Cites Work
- Tree representations of ternary relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relations related to betweenness: their structure and automorphisms
- Sylvester-Gallai theorem and metric betweenness
- Axiomatic characterization of the interval function of a graph
- Intervals and steps in a connected graph
- Trees, Lattices, Order, and Betweenness
- Zur Axiomatik der teilweise geordneten Mengen
- Betweenness and Comparability Obtained from Binary Relations
- Transitivities of Betweenness
- Représentations en arbre de proximités relatives
- The interval function of a connected graph and road systems
Cited In (12)
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Single peaked domains with tree-shaped spectra
- Betweenness spaces and tree algebras
- Axiomatic characterization of the interval function of a block graph
- Axiomatic characterizations of Ptolemaic and chordal graphs
- Title not available (Why is that?)
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- Axiomatic characterization of the interval function of a bipartite graph
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- Axiomatic characterization of the interval function of a bipartite graph
- The axiomatic characterization of the interval function of distance hereditary graphs
- Axiomatic characterization of the toll walk function of some graph classes
This page was built for publication: Finite Sholander trees, trees, and their betweenness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q641185)
