Graph parameters and Ramsey theory

DOI10.1007/978-3-319-78825-8_15MaRDI QIDQ1642694zbMATH OpenOpenAlexFDO

Authors Vadim Lozin

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_15

zbMATH Keywords

minimal hereditary classesneighbourhood diversityVC-dimension

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• For graphs there are only four types of hereditary Ramsey classes
• Graph classes with linear Ramsey numbers
• Minimal vertex Ramsey graphs and minimal forbidden subgraphs
• Chromatic number is Ramsey distinguishing
• On partitions of hereditary properties of graphs

Cited in

(14)

• Critical properties and complexity measures of read-once Boolean functions
• Hereditary classes of graphs: a parametric approach
• A Ramsey-type theorem for the matching number regarding connected graphs
• scientific article; zbMATH DE number 15259 (Why is no real title available?)
• scientific article; zbMATH DE number 3520446 (Why is no real title available?)
• Generalized Ramsey theory and decomposable properties of graphs
• The Micro-world of Cographs
• Graph functionality
• Andrásfai and Vega graphs in Ramsey–Turán theory
• Chromatic number is Ramsey distinguishing
• Critical properties of bipartite permutation graphs
• A Ramsey-type theorem on deficiency
• Ramsey-type results on parameters related to domination
• The micro-world of cographs

This page was built for publication: Graph parameters and Ramsey theory

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