6 citations · 20 across the 12 of their papers we have counts for
12 papers
A De Bruijn-Erdős theorem in graphs?
Vašek Chvátal
A set of points in the Euclidean plane determines at least distinct lines unless these points are collinear. In 2006, Chen and Chvátal asked whether the same statement…
McCulloch-Pitts brains and pseudorandom functions
Vašek Chvátal, Mark Goldsmith, Nan Yang
In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system. Motivated by EEG recordings of normal brain activity, Chvátal and Goldsmi…
Brains and pseudorandom generators
Vašek Chvátal, Mark Goldsmith, Nan Yang
In a pioneering classic, Warren McCulloch and Walter Pitts proposed a model of the central nervous system; motivated by EEG recordings of normal brain activity, Chv\' atal and Gold…
A De Bruijn-Erdos theorem for 1-2 metric spaces
Vasek Chvatal
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…
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…
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…