An Extension of Mantel’s Theorem to k-Graphs

DOI10.1080/00029890.2020.1693227zbMath1433.05308OpenAlexW3007840676MaRDI QIDQ5217614

András Gyárfás, Zoltan Fueredi

Publication date: 25 February 2020

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2020.1693227

zbMATH Keywords

fanlinear \(k\)-graph

Mathematics Subject Classification ID

Extremal set theory (05D05) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

The exact linear Turán number of the sail ⋮ Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$ ⋮ The linear Turán number of small triple systems or why is the wicket interesting? ⋮ Problems close to my heart ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Turán and Ramsey numbers in linear triple systems ⋮ Linear Turán numbers of acyclic triple systems ⋮ Spectral extremal results for hypergraphs ⋮ Turán and Ramsey numbers in linear triple systems. II ⋮ Crowns in linear \(3\)-graphs of minimum degree \(4\) ⋮ A linear hypergraph extension of Turán's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• A new generalization of Mantel's theorem to \(k\)-graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Turán problems for integer-weighted graphs

This page was built for publication: An Extension of Mantel’s Theorem to k-Graphs