Maximal t-Critical Linear Hypergraphs

Abstract

A construction using finite affine geometries is given to show that the maximum number of edges in a τ -critical linear hypergraph is (1−o(1))τ2. This asymptotically answers a question of Roudneff [14], Aharoni and Ziv [1]. 1 This copy was printed on November 16, 2001. Submitted to Graphs and Combinatorics

DOI: 10.1007/s003730170056

Cite this paper

@article{Fredi2001MaximalTL, title={Maximal t-Critical Linear Hypergraphs}, author={Zolt{\'a}n F{\"{u}redi}, journal={Graphs and Combinatorics}, year={2001}, volume={17}, pages={73-78} }