2 citations · 2 across the 1 of their papers we have counts for
3 papers
math.CO2013★ 2 cited
Number of lines in hypergraphs
Pierre Aboulker, Adrian Bondy, Xiaomin Chen +3
Chen and Chvátal introduced the notion of lines in hypergraphs; they proved that every 3-uniform hypergraph with vertices either has a line that consists of all vertices or…
math.CO2012
A De Bruijn-Erdos theorem for chordal graphs
Laurent Beaudou, Adrian Bondy, Xiaomin Chen +5
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal…
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…