Discrete Helicity on Graphs: Pfaffian Energies and Clique Bounds

We introduce a helicity functional of each order on graphs for real-valued edge forms, and give it a unified local Pfaffian realization. Motivated by the continuous energy inequality, we further construct a discrete version of helicity energy, and prove sharp Maclaurin inequalities for these energies. In particular, a special case of these Maclaurin inequalities yields a lower bound on the clique number, depending on the choice of edge form. As an application, we use this certificate to prove that every nonempty $d$-regular graph with smallest adjacency eigenvalue at least $-3$ satisfies $ω(G)\ge d\,g(η)-C$, where $C$ is an absolute constant and $g(η)$ is a rank-dependent coefficient taking values between $1/4$ and $1/3$. Building on the structural results of Koolen, Yang and Yang, this improves the known clique-number bound to the optimal leading constant $1/4$, whose asymptotic sharpness follows from Yang and Koolen's construction.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17168
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Discrete Helicity on Graphs: Pfaffian Energies and Clique Bounds

Jingqi Li
arXiv (Cornell University)
Graph theory and applications
preprint

Discrete Helicity on Graphs: Pfaffian Energies and Clique Bounds

Jingqi Li
preprint en

Abstract

We introduce a helicity functional of each order on graphs for real-valued edge forms, and give it a unified local Pfaffian realization. Motivated by the continuous energy inequality, we further construct a discrete version of helicity energy, and prove sharp Maclaurin inequalities for these energies. In particular, a special case of these Maclaurin inequalities yields a lower bound on the clique number, depending on the choice of edge form. As an application, we use this certificate to prove that every nonempty $d$-regular graph with smallest adjacency eigenvalue at least $-3$ satisfies $ω(G)\ge d\,g(η)-C$, where $C$ is an absolute constant and $g(η)$ is a rank-dependent coefficient taking values between $1/4$ and $1/3$. Building on the structural results of Koolen, Yang and Yang, this improves the known clique-number bound to the optimal leading constant $1/4$, whose asymptotic sharpness follows from Yang and Koolen's construction.

arXiv (Cornell University)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon