Search arXivSearch

arXiv · 2605.03470

Criteria on forbidden subgraphs in the complements for positive Lin--Lu--Yau curvature

Abstract

We investigate forbidden subgraph conditions in the complement of a graph that guarantee positive Lin--Lu--Yau curvature. In particular, we prove that every graph whose complement contains no $4$-cycles has positive Lin--Lu--Yau curvature, with the only exception of the $4$-vertex path. We further prove that, for any integer $t\ge2$, every graph on at least $\max\{t^2-2t+2, 8t\}$ vertices whose complement contains no $K_{2,t}$ has positive curvature. In addition, this lower bound on the number of vertices is optimal for $t\geq 10$. Finally, we construct examples showing that, in general, the forbidden subgraphs in these results cannot be replaced by cycles of length other than $4$ or by complete bipartite graphs $K_{s,t}$ with $s> 2$ and $t> 2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaizhe Chen, Shiping Liu, Zhe You. 2026-05-05. Criteria on forbidden subgraphs in the complements for positive Lin--Lu--Yau curvature. https://arxiv.org/abs/2605.03470

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO