Maximal τ-Critical Linear Hypergraphs | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Maximal τ-Critical Linear Hypergraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Illinois, 1409 W. Green St., Urbana, IL 61801, USA. e-mail: z-furedi@math.uiuc.edu, , , , , , US

    Zoltán Füredi

Authors
  1. Zoltán Füredi
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: June 28, 1999 Final version received: October 22, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Füredi, Z. Maximal τ-Critical Linear Hypergraphs. Graphs Comb 17, 73–78 (2001). https://doi.org/10.1007/s003730170056

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170056