Explicit constructions of triple systems for Ramsey–Turán problems

DOI10.1002/JGT.20156MaRDI QIDQ5486274zbMATH OpenOpenAlexFDO

Authors Dhruv Mubayi, Vera T. Sós

Publication date 6 September 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20156

zbMATH Keywords

extremal hypergraph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Triple systems (05B07)

Recommendations

• Turán and Ramsey numbers in linear triple systems
• Turán and Ramsey numbers in linear triple systems. II
• On the Turán number of triple systems
• An explicit construction for a Ramsey problem
• On ramsey-tuŕan numbers for 3-graphs
• scientific article; zbMATH DE number 3724497
• Turán-Ramsey theorems and simple asymptotically extremal structures
• A new class of Ramsey-Turán problems
• Multicolor Ramsey numbers for triple systems
• A few remarks on Ramsey--Turán-type problems

Cited in

(6)

• The bandwidth theorem for locally dense graphs
• Triangle factors of graphs without large independent sets and of weighted graphs
• Turán and Ramsey numbers in linear triple systems. II
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On explicit constructions of designs
• A 2-stable family of triple systems

This page was built for publication: Explicit constructions of triple systems for Ramsey–Turán problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486274)