L. Chandran

collaborators

4 papers

math.CO2025

Generalized Zykov's Theorem

Rajat Adak, L. Sunil Chandran

For a simple graph $G$ , let $n$ denote its number of vertices, and let $N (G, K_{t})$ denote the number of copies of $K_{t}$ in $G$ . Zykov's theorem (1949) asserts that for any $K_{r + 1}$ …

math.CO2025

Vertex-Based Localization of Generalized TurÃ¡n Problems

Rajat Adak, L. Sunil Chandran

Let $F$ be a family of graphs. A graph is called $F$ -free if it does not contain any member of $F$ . Generalized TurÃ¡n problems aim to maximize the nu…

math.CO2025

Vertex-Based Localization of TurÃ¡n's Theorem

Rajat Adak, L. Sunil Chandran

Let $G$ be a simple graph with $n$ vertices and $m$ edges. According to TurÃ¡n's theorem, if $G$ is $K_{r + 1}$ -free, then $m \leq ∣ E (T (n, r)) ∣,$ where $T (n, r)$ denotes the TurÃ¡n g…

math.CO2025

Vertex-Based Localization of ErdÅs-Gallai Theorems for Paths and Cycles

Rajat Adak, L. Sunil Chandran

For a simple graph $G$ , let $n$ and $m$ denote the number of vertices and edges in $G$ , respectively. The ErdÅs-Gallai theorem for paths states that in a simple $P_{k}$ -free graph,…

Generalized Zykov's Theorem

Vertex-Based Localization of Generalized TurÃ¡n Problems

Vertex-Based Localization of TurÃ¡n's Theorem

Vertex-Based Localization of ErdÅs-Gallai Theorems for Paths and Cycles

Vertex-Based Localization of ErdÅs-Gallai Theorems for Paths and Cycles