Edge mappings of graphs: Turán type parameters

DOI10.1016/J.EJC.2025.104140MaRDI QIDQ6976308zbMATH OpenFDO

Authors Yair Caro, Balázs Patkós, Zsolt Tuza, Máté Vizer

Publication date 2 June 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104140

zbMATH Keywords

set mappingsTurán-type problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites work

• Degrees and matchings
• Extremal problems concerning transformations of the edges of the complete hypergraphs
• Extremal problems concerning transformations of the set of edges of the complete graph
• scientific article; zbMATH DE number 4130414 (Why is no real title available?)
• scientific article; zbMATH DE number 3189017 (Why is no real title available?)
• Intersection theorems for systems of sets
• On the structure of linear graphs
• On the structure of set-mappings
• Short proofs of some extremal results. II.
• Short proofs of some extremal results. III
• Sub-Ramsey numbers for arithmetic progressions
• Sub-Ramsey numbers of arithmetic progressions
• Turán numbers for disjoint copies of graphs

This page was built for publication: Edge mappings of graphs: Turán type parameters

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