6 citations · 20 across the 12 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Lines in hypergraphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a…
math.CO2011★ 1 cited
Finite Sholander Trees, Trees, and their Betweenness
Vašek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer
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-cal…