The asymptotic number of triple systems not containing a fixed one

DOI10.1016/S0012-365X(00)00280-6zbMath0977.05018OpenAlexW2034987679WikidataQ127613914 ScholiaQ127613914MaRDI QIDQ5937939

Brendan Nagle, Vojtěch Rödl

Publication date: 18 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00280-6

zbMATH Keywords

hypergraphtriple systemsTurán numbers

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Asymptotic enumeration (05A16) Triple systems (05B07)

Related Items (17)

On characterizing hypergraph regularity ⋮ Hypergraphs with many Kneser colorings ⋮ The structure of almost all graphs in a hereditary property ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Almost all triangle-free triple systems are tripartite ⋮ The hypergraph regularity method and its applications ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Colourings of Hypergraphs Without Monochromatic Fano Planes ⋮ Note on the 3-graph counting Lemma ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ Counting subgraphs in quasi‐random 4‐uniform hypergraphs ⋮ Turán theorems for even cycles in random hypergraph ⋮ Regularity properties for triple systems ⋮ Hereditary properties of hypergraphs ⋮ On the Ramsey number of sparse 3-graphs ⋮ Complete Partite subgraphs in dense hypergraphs

This page was built for publication: The asymptotic number of triple systems not containing a fixed one