A homological approach to two problems on finite sets

DOI10.1023/A:1018630111976zbMath0916.05069MaRDI QIDQ1283453

Rita Csákány, Jeffry Kahn

Publication date: 7 July 1999

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Erdős-Ko-Rado theoremset systemintersectionChvátal conjecture

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (13)

Hypergraphs without non-trivial intersecting subgraphs ⋮ Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Turán numbers for 3-uniform linear paths of length 3 ⋮ Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three ⋮ 3-uniform hypergraphs and linear cycles ⋮ Turán problems and shadows. I: Paths and cycles ⋮ 3-Uniform Hypergraphs and Linear Cycles ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ One more Turán number and Ramsey number for the loose 3-uniform path of length three ⋮ Set systems without a simplex or a cluster ⋮ A hierarchy of maximal intersecting triple systems ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Turán Problems and Shadows III: Expansions of Graphs

Cites Work

• Unnamed Item
• Exact solution of some Turán-type problems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• An Extremal Set-Intersection Theorem

This page was built for publication: A homological approach to two problems on finite sets