Fifth-year PhD candidate · Mathematics Since 2022

Gyaneshwar
Agrahari

A graph theorist at heart and an advocate for education for everyone.

InstitutionLouisiana State University
DepartmentMathematics
AdvisorZhiyu Wang
Office327 Lockett Hall
Personalagrahari.gyaneshwar77@gmail.com
Institutionalgagrah1@lsu.edu
Gyaneshwar Agrahari
Boca Raton, FL CREDIT: BISHAL LAMICHHANE

Hi, my name is Gyaneshwar Agrahari — you can also call me Gyan or G (My students call me Mr. G) . I was born and raised in Butwal, Nepal. I am currently a PhD candidate at Louisiana State University in the Mathematics Department working under Zhiyu Wang. I completed my Bachelor's at Youngstown State University with majors in Physics and Mathematics.

I primarily work in structural and extremal graph theory, applied machine learning, math education, and geospatial equity analysis. My dissertation focuses on counting subgraphs in planar graphs with higher connectivity and characterizing the extremal graphs.

My dissertation began with a question my advisor asked after a talk by Ryan Martin in April 2024: what happens to cycle counts in planar graphs when you add a connectivity condition? That question has kept us busy ever since. Read the story →

Fig. 1 — the author, as a graph hover any vertex
G Graph Theory extremal · structural Applied ML graphs · learning Math Education instructor of record · LSU extremal graph theory Γ-harmonious labeling planar cycles semi-supervised learning p-Laplacian regression random forests open-source resources confidence & belonging concreteness → abstraction
G = (V, E) · |V| = 13 · |E| = 12 · deg(v₀) = 3 · the drawing is planar, naturally.
Three threads Graphs · Education · Applications
A result I'm fond of #C₅ ≤ 9n − 50
Located at 30.41° N, 91.18° W