Zhouningxin Wang

activity

20202026

most citedMapping sparse signed graphs to

(K_{2 k}, M)

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

collaborators

19 papers

math.CO2026

On the structure of graphs with given odd girth and large algebraic connectivity

Zhengbo Chen, Chenxing Li, Zhouningxin Wang

A classical result of Andrásfai, Erdős, and Sós states that every $n$ -vertex graph with odd girth at least $2 k + 1$ and minimum degree larger than $\frac{2 n}{2 k + 1}$ is bipartite. Rat…

math.CO2026

A local clique density theorem in $H$ -free graphs

Jiaao Li, Xinyuan Li, Yan Wang +1

In 2016, Reiher's clique density theorem determined the minimum number of copies of $K_{t}$ in a graph with a prescribed edge density. In this paper, we investigate its local version…

math.CO2026

Frustration index of a signed planar graph and the feedback vertex set

Sirui Chen, Jiaao Li, Zhouningxin Wang

A feedback vertex set of a graph is a set of vertices whose deletion leaves a forest. In 2016, Dross, Montassier, and Pinlou conjectured that every planar graph $G$ of girth at lea…

math.CO2026

Reconfiguration of Nowhere-zero Flows

Daniel W. Cranston, Jiaao Li, Bo Su +2

Fix an abelian group $A$ , a graph $G$ , and nowhere-zero $A$ -flows $f^{'}$ and $f^{''}$ on $G$ . Now $f^{'}$ and $f^{''}$ are \emph{ $A$ -flow-adjacent} if there exists a cycle $C$ in $G$ such tha…

math.CO2026

Positive and negative 3-energies of graphs

Zhengbo Chen, Zhouningxin Wang, Xiao-Dong Zhang

For a simple graph $G$ with $n$ vertices, let $A_{G}$ denote the adjacency matrix of $G$ , and let $λ_{1} (G) \geq λ_{2} (G) \geq \dots \geq λ_{n} (G)$ be its eigenvalues. For an integer $p \g…

math.CO2026

Characterization of strongly $Z_{ℓ}$ -connected graphs of small order

Jiaao Li, Bo Su, Zhouningxin Wang +1

A graph is strongly $Z_{ℓ}$ -connected if for each boundary function $β : V (G) \mapsto Z_{ℓ}$ with $β (v) \equiv d (v) (mod 2)$ for every vertex $v$ and $\sum_{v \in V(G)} β(v)…

math.CO2026

Orientations of $10$ -Edge-Connected Planar Multigraphs and Applications

Daniel W. Cranston, Jiaao Li, Bo Su +2

A graph is called strongly $Z_{2 k + 1}$ -connected if for each boundary function $β : V (G) \mapsto Z_{2 k + 1}$ with $\sum_{v \in V (G)} β (v) \equiv 0 (mod 2 k + 1)$ , there exists an orientatio…

math.CO2025

Frustration indices of signed subcubic graphs

Sirui Chen, Jiaao Li, Zhouningxin Wang

The frustration index of a signed graph is defined as the minimum number of negative edges among all switching-equivalent signatures. This can be regarded as a generalization of th…

math.CO2025

A Tverberg-type problem of Kalai: Two negative answers to questions of Alon and Smorodinsky, and the power of disjointness

Wenchong Chen, Gennian Ge, Yang Shu +2

Let $f_{r} (d, s_{1}, \dots, s_{r})$ denote the least integer $n$ such that every $n$ -point set $P \subseteq R^{d}$ admits a partition $P = P_{1} \cup \dots \cup P_{r}$ with the property that…

math.CO2025

Fractional balanced chromatic number of signed subcubic graphs

Xiaolan Hu, Luis Kuffner, Jiaao Li +4

A signed graph is a pair $(G, σ)$ , where $G$ is a graph and $σ : E (G) \to {-, +}$ , called signature, is an assignment of signs to the edges. Given a signed graph $(G, σ)$ wit…

math.CO2024

Planar Graphs with Homomorphisms to the 9-cycle

Daniel W. Cranston, Jiaao Li, Zhouningxin Wang +1

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at lea…

math.CO2023

Density of $3$ -critical signed graphs

Laurent Beaudou, Penny Haxell, Kathryn Nurse +2

We say that a signed graph is $k$ -critical if it is not $k$ -colorable but every one of its proper subgraphs is $k$ -colorable. Using the definition of colorability due to Naserasr,…

math.CO2023

Critically 3-frustrated signed graphs

Chiara Cappello, Reza Naserasr, Eckhard Steffen +1

Extending the notion of maxcut, the study of the frustration index of signed graphs is one of the basic questions in the theory of signed graphs. Recently two of the authors initia…

math.CO2022★ 1 cited

Circular flows in mono-directed signed graphs

Jiaao Li, Reza Naserasr, Zhouningxin Wang +1

In this paper the concept of circular $r$ -flows in a mono-directed signed graph $(G, σ)$ is introduced. That is a pair $(D, f)$ , where $D$ is an orientation on $G$ and $f: E(G)\to…

math.CO2021

Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem

Reza Naserasr, Zhouningxin Wang

The notion of the circular coloring of signed graphs is a recent one that simultaneously extends both notions of the circular coloring of graphs and $0$ -free coloring of signed gra…

math.CO2021★ 1 cited

Circular $(4 - ε)$ -coloring of some classes of signed graphs

František Kardoš, Jonathan Narboni, Reza Naserasr +1

A circular $r$ -coloring of a signed graph $(G, σ)$ is an assignment $ϕ$ of points of a circle $C_{r}$ of circumference $r$ to the vertices of $(G, σ)$ such that for each positive edg…

math.CO2021★ 3 cited

Mapping sparse signed graphs to $(K_{2 k}, M)$

Reza Naserasr, Riste Škrekovski, Zhouningxin Wang +1

A homomorphism of a signed graph $(G, σ)$ to $(H, π)$ is a mapping of vertices and edges of $G$ to (respectively) vertices and edges of $H$ such that adjacencies, incidences and th…

math.CO2021

Density of $C_{- 4}$ -critical signed graphs

Reza Naserasr, Lan Anh Pham, Zhouningxin Wang

A signed bipartite (simple) graph $(G, σ)$ is said to be $C_{- 4}$ -critical if it admits no homomorphism to $C_{- 4}$ (a negative 4-cycle) but every proper subgraph of it does. In th…

math.CO2020★ 1 cited

Circular chromatic number of signed graphs

Reza Naserasr, Zhouningxin Wang, Xuding Zhu

A signed graph is a pair $(G, σ)$ , where $G$ is a graph and $σ : E (G) \to {+, -}$ is a signature which assigns to each edge of $G$ a sign. Various notions of coloring of signed gr…

On the structure of graphs with given odd girth and large algebraic connectivity

A local clique density theorem in H-free graphs

Frustration index of a signed planar graph and the feedback vertex set

Reconfiguration of Nowhere-zero Flows

Positive and negative 3-energies of graphs

Characterization of strongly Zℓ​-connected graphs of small order

Orientations of 10-Edge-Connected Planar Multigraphs and Applications

Frustration indices of signed subcubic graphs

A Tverberg-type problem of Kalai: Two negative answers to questions of Alon and Smorodinsky, and the power of disjointness

Fractional balanced chromatic number of signed subcubic graphs

Planar Graphs with Homomorphisms to the 9-cycle

Density of 3-critical signed graphs

Critically 3-frustrated signed graphs

Circular flows in mono-directed signed graphs

Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem

Circular (4−ε)-coloring of some classes of signed graphs

Mapping sparse signed graphs to (K2k​,M)

Density of C−4​-critical signed graphs

Circular chromatic number of signed graphs

A local clique density theorem in $H$ -free graphs

Characterization of strongly $Z_{ℓ}$ -connected graphs of small order

Orientations of $10$ -Edge-Connected Planar Multigraphs and Applications

Density of $3$ -critical signed graphs

Circular $(4 - ε)$ -coloring of some classes of signed graphs

Mapping sparse signed graphs to $(K_{2 k}, M)$

Density of $C_{- 4}$ -critical signed graphs