Vertex-based localization of generalized Turán problems
From MaRDI portal
Cites work
- A localized approach to generalized Turán problems
- Exact results on generalized Erdős-Gallai problems
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3661366 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Localised graph Maclaurin inequalities
- Localization: a framework to generalize extremal graph problems
- 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: Vertex-based localization of generalized Turán problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409388)