L. Chandran

activity

20062025

most citedOn Eulerian orientations of even-degree hypercubes

4 citations · 6 across the 6 of their papers we have counts for

collaborators

7 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 num…

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 gra…

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, $…

math.CO2018★ 4 cited

On Eulerian orientations of even-degree hypercubes

Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan

It is well known that \textit{every} Eulerian orientation of an Eulerian $2 k$ -edge connected (undirected) graph is strongly $k$ -edge connected. An important goal in the area is to…

cs.IT2006★ 1 cited

A Combinatorial Family of Near Regular LDPC Codes

K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran +1

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibi…