Abstract
O. Einstein (2008) proved Bollobás-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker variants.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Babai and P. Frankl: Linear algebra methods in combinatorics, Department of Computer Science, The University of Chicago, September 1992.
B. Bollobás: On generalized graphs, Acta Math. Acad. Sci. Hungar 16 (1965) 447–452.
O. Einstein: Properties of intersecting families of ordered sets, Combinatorica 28 (2008), 37–44.
P. Frankl: An extremal problem for two families of sets, European J. Combin. 3 (1982), 125–127.
Z. Füredi: Geometrical solution of an intersection problem for two hypergraphs, European J. Combin. 5 (1984), 133–136.
L. Lovász: Flats in matroids and geometric graphs, in: Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham, 1977), 45–86. Academic Press, London, 1977.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. NRF-2017R1A2B4005020).
Rights and permissions
About this article
Cite this article
Oum, SI., Wee, S. A Remark on the Paper “Properties of Intersecting Families of Ordered Sets” by O. Einstein. Combinatorica 38, 1279–1284 (2018). https://doi.org/10.1007/s00493-018-3812-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-018-3812-3