Localization: a framework to generalize extremal graph problems

DOI10.1007/978-3-032-17156-6_1MaRDI QIDQ7307301zbMATH OpenFDO

Authors Rajat Adak, L. Sunil Chandran

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A localized approach for Turán number of long cycles
• A localized approach to generalized Turán problems
• Eine Extremalaufgabe aus der Graphentheorie.
• Exact results on generalized Erdős-Gallai problems
• scientific article; zbMATH DE number 3661366 (Why is no real title available?)
• Local properties of the spectral radius and Perron vector in graphs
• Localised graph Maclaurin inequalities
• Localized version of hypergraph Erdős-Gallai theorem
• Localized versions of extremal problems
• On maximal paths and circuits of graphs
• On the maximum number of cliques in a graph
• The maximum number of cliques in graphs without long cycles

This page was built for publication: Localization: a framework to generalize extremal graph problems

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