Sparse sets in triangle-free graphs.

DOI10.21136/MB.2025.0079-24MaRDI QIDQ7346309zbMATH OpenFDO

Authors Tınaz Ekim, Burak Nur Erdem, John Gimbel

Publication date 10 September 2026

Published in Mathematica Bohemica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21136/MB.2025.0079-24

Mathematics Subject Classification ID

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

Cites work

• A note on Ramsey numbers
• Advances on defective parameters in graphs
• Defective coloring on classes of perfect graphs
• Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs
• Exact values of defective Ramsey numbers in graph classes
• Graph classes and Ramsey numbers
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Independence in graphs with maximum degree four
• Longest paths and cycles in K1,3-free graphs
• Lower bounds on size and independence inK4-free graphs
• On 1-dependent ramsey numbers for graphs
• Planar Ramsey numbers
• Practical graph isomorphism. II.
• Small 1-defective Ramsey numbers in perfect graphs
• Some defective parameters in graphs
• Some Ramsey-Type Numbers and the Independence Ratio
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Sparse sets in triangle-free graphs.

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