arXiv subjects

Jiaao Li

Publications and source records attributed to Jiaao Li.

34 records · Page 2Linked to original sources

arXiv2025

Realizing degree sequences with $\mathcal S_3$-connected graphs

A graph $G$ is $\mathcal S_3$-connected if, for any mapping $β: V (G) \mapsto {\mathbb Z}_3$ with $\sum_{v\in V(G)} β(v)\equiv 0\pmod3$, there exists a strongly connected orientation $D$ satisfying $d^{+}_D(v)-d^{-}_D(v)\equiv β(v)\pmod{3}$ for any $v \in V(G)$. It is known that $\mathcal S_3$-connected graphs are contractible configurations for the property of flow index strictly less than three. In this paper, we provide a complete characterization of graphic sequences that have an $\mathcal{S}_{3}$-connected realization: A graphic sequence $π=(d_1,\, \ldots,\, d_n )$ has an $\mathcal S_3$-connected realization if and only if $\min \{d_1,\, \ldots,\, d_n\} \ge 4$ and $\sum^n_{i=1}d_i \ge 6n - 4$. Consequently, every graphic sequence $π=(d_1,\, \ldots,\, d_n )$ with $\min \{d_1,\, \ldots,\, d_n\} \ge 6$ has a realization $G$ with flow index strictly less than three. This supports a conjecture of Li, Thomassen, Wu and Zhang [European J. Combin., 70 (2018) 164-177] that every $6$-edge-connected graph has flow index strictly less than three.

math.CO↗

arXiv2024

Planar Graphs with Homomorphisms to the 9-cycle

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 least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$. The $k=1$ case is the well-known Grötzsch's $3$-coloring theorem. For general $k$, in 2013 Lovász, Thomassen, Wu, and Zhang showed that it suffices to have odd-girth at least $6k+1$. Improvements are known for $C_5$ and $C_7$ in [Combinatorica 2017, SIDMA 2020, Combinatorica 2022]. For $C_9$ we improve this hypothesis by showing that it suffices to have odd-girth 23. Our main tool is a variation on the potential method applied to modular orientations. This allows more flexibility when seeking reducible configurations. The same techniques also prove some results on circular coloring of signed planar graphs.

math.CO↗

arXiv2022

Circular flows in mono-directed signed graphs

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 (-r,r)$ satisfies that $|f(e)|\in [1, r-1]$ for each positive edge $e$ and $|f(e)|\in [0, \frac{r}{2}-1]\cup [\frac{r}{2}+1, r)$ for each negative edge $e$, and the total in-flow equals the total out-flow at each vertex. The circular flow index of a signed graph $(G, σ)$ with no positive bridge, denoted $Φ_c(G,σ)$, is the minimum $r$ such that $(G, σ)$ admits a circular $r$-flow. This is the dual notion of circular colorings and circular chromatic numbers of signed graphs recently introduced in [Circular chromatic number of signed graphs. R. Naserasr, Z. Wang, and X. Zhu. Electronic Journal of Combinatorics, 28(2)(2021), \#P2.44], and is distinct from the concept of circular flows in bi-directed graphs associated to signed graphs studied in the literature. We give several equivalent definitions, study basic properties of circular flows in mono-directed signed graphs, explore relations with flows in graphs, and focus on upper bounds on $Φ_c(G,σ)$ in terms of the edge-connectivity of $G$. Meanwhile, we note that for the particular values of $r_{_k}=\frac{2k}{k-1}$, and when restricted to two natural subclasses of signed graphs, the existence of a circular $r_{_k} $-flow is strongly connected with the existence of a modulo $k$-orientation, and in case of planar graphs, based on duality, with the homomorphisms to $C_{-k}$.

math.CO↗

arXiv2022

A note on shortest circuit cover of 3-edge colorable cubic signed graphs

A {sign-circuit cover} $\mathcal{F}$ of a signed graph $(G, σ)$ is a family of sign-circuits which covers all edges of $(G, σ)$. The shortest sign-circuit cover problem was initiated by Má$\check{\text{c}}$ajová, Raspaud, Rollová, and Škoviera (JGT 2016) and received many attentions in recent years. In this paper, we show that every flow-admissible 3-edge colorable cubic signed graph $(G, σ)$ has a sign-circuit cover with length at most $\frac{20}{9} |E(G)|$.

math.CO↗

arXiv2020

Group Connectivity under $3$-Edge-Connectivity

Let $S,T$ be two distinct finite Abelian groups with $|S|=|T|$. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero $S$-flow if and only if it admits a nowhere-zero $T$-flow. Jaeger, Linial, Payan and Tarsi in 1992 introduced group connectivity as an extension of flow theory, and they asked whether such a relation holds for group connectivity analogy. It was negatively answered by Hušek, Mohelníková and Šámal in 2017 for graphs with edge-connectivity 2 for the groups $S=\mathbb{Z}_4$ and $T=\mathbb{Z}_2^2$. In this paper, we extend their results to $3$-edge-connected graphs (including both cubic and general graphs), which answers open problems proposed by Hušek, Mohelníková and Šámal(2017) and Lai, Li, Shao and Zhan(2011). Combining some previous results, this characterizes all the equivalence of group connectivity under $3$-edge-connectivity, showing that every $3$-edge-connected $S$-connected graph is $T$-connected if and only if $\{S,T\}\neq \{\mathbb{Z}_4,\mathbb{Z}_2^2\}$.

math.CO↗

arXiv2020

Circular Coloring and Fractional Coloring in Planar Graphs

We study the following Steinberg-type problem on circular coloring: for an odd integer $k\ge 3$, what is the smallest number $f(k)$ such that every planar graph of girth $k$ without cycles of length from $k+1$ to $f(k)$ admits a homomorphism to the odd cycle $C_k$ (or equivalently, is circular $(k,\frac{k-1}{2})$-colorable). Known results and counterexamples on Steinberg's Conjecture indicate that $f(3)\in\{6,7\}$. In this paper, we show that $f(k)$ exists if and only if $k$ is an odd prime. Moreover, we prove that for any prime $p\ge 5$, $$p^2-\frac{5}{2}p+\frac{3}{2}\le f(p)\le 2p^2+2p-5.$$ We conjecture that $f(p)\le p^2-2p$, and observe that the truth of this conjecture implies Jaeger's conjecture that every planar graph of girth $2p-2$ has a homomorphism to $C_p$ for any prime $p\ge 5$. Supporting this conjecture, we prove a related fractional coloring result that every planar graph of girth $k$ without cycles of length from $k+1$ to $\lfloor\frac{22k}{3}\rfloor$ is fractional $(k:\frac{k-1}{2})$-colorable for any odd integer $k\ge 5$.

math.CO↗

arXiv2020

Flow Extensions and Group Connectivity with Applications

We study the flow extension of graphs, i.e., pre-assigning a partial flow on the edges incident to a given vertex and aiming to extend to the entire graph. This is closely related to Tutte's $3$-flow conjecture(1972) that every $4$-edge-connected graph admits a nowhere-zero $3$-flow and a $\mathbb{Z}_3$-group connectivity conjecture(3GCC) of Jaeger, Linial, Payan, and Tarsi(1992) that every $5$-edge-connected graph $G$ is $\mathbb{Z}_3$-connected. Our main results show that these conjectures are equivalent to their natural flow extension versions and present some applications. The $3$-flow case gives an alternative proof of Kochol's result(2001) that Tutte's $3$-flow conjecture is equivalent to its restriction on $5$-edge-connected graphs and is implied by the 3GCC. It also shows a new fact that Gr{ö}tzsch's theorem (that triangle-free planar graphs are $3$-colorable) is equivalent to its seemly weaker girth five case that planar graphs of grith $5$ are $3$-colorable. Our methods allow to verify 3GCC for graphs with crossing number one, which is in fact reduced to the planar case proved by Richter, Thomassen and Younger(2017). Other equivalent versions of 3GCC and related partial results are obtained as well.

math.CO↗

arXiv2020

On $3$-flow-critical graphs

A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a vertex of degree three. In this paper, we study the structure and extreme edge density of $3$-flow-critical graphs. We apply structure properties to obtain lower and upper bounds on the density of $3$-flow-critical graphs, that is, for any $3$-flow-critical graph $G$ on $n$ vertices, $$\frac{8n-2}{5}\le |E(G)|\le 4n-10,$$ where each equality holds if and only if $G$ is $K_4$. We conjecture that every $3$-flow-critical graph on $n\ge 7$ vertices has at most $3n-8$ edges, which would be tight if true. For planar graphs, the best possible density upper bound of $3$-flow-critical graphs on $n$ vertices is $\frac{5n-8}{2}$, known from a result of Kostochka and Yancey (JCTB 2014) on vertex coloring $4$-critical graphs by duality.

math.CO↗

arXiv2019

Anti-Ramsey numbers of paths and cycles in hypergraphs

The anti-Ramsey problem was introduced by Erdős, Simonovits and Sós in 1970s. The anti-Ramsey number of a hypergraph $\mathcal{H}$, $ar(n,s, \mathcal{H})$, is the smallest integer $c$ such that in any coloring of the edges of the $s$-uniform complete hypergraph on $n$ vertices with exactly $c$ colors, there is a copy of $\mathcal{H}$ whose edges have distinct colors. In this paper, we determine the anti-Ramsey numbers of linear paths and loose paths in hypergraphs for sufficiently large $n$, and give bounds for the anti-Ramsey numbers of Berge paths. Similar exact anti-Ramsey numbers are obtained for linear/loose cycles, and bounds are obtained for Berge cycles. Our main tools are path extension technique and stability results on hypergraph Turán problems of paths and cycles.

math.CO↗

arXiv2019

Spanning Triangle-trees and Flows of Graphs

In this paper we study the flow-property of graphs containing a spanning triangle-tree. Our main results provide a structure characterization of graphs with a spanning triangle-tree admitting a nowhere-zero $3$-flow. All these graphs without nowhere-zero $3$-flows are constructed from $K_4$ by a so-called bull-growing operation. This generalizes a result of Fan et al. in 2008 on triangularly-connected graphs and particularly shows that every $4$-edge-connected graph with a spanning triangle-tree has a nowhere-zero $3$-flow. A well-known classical theorem of Jaeger in 1979 shows that every graph with two edge-disjoint spanning trees admits a nowhere-zero $4$-flow. We prove that every graph with two edge-disjoint spanning triangle-trees has a flow strictly less than $3$.

math.CO↗

arXiv2019

Flows on flow-admissible signed graphs

In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero $6$-flow. Bouchet himself proved that such signed graphs admit nowhere-zero $216$-flows and Zyka further proved that such signed graphs admit nowhere-zero $30$-flows. In this paper we show that every flow-admissible signed graph admits a nowhere-zero 11-flow.

math.CO↗

arXiv2019

Complementary Graphs with Flows Less Than Three

X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph $G$ with $|V(G)|\ge 44$, if $\min\{δ(G),δ(G^c)\}\ge 4$, then either $G$ or its complementary graph $G^c$ has a nowhere-zero $3$-flow. In this paper, we improve this result by showing that if $|V(G)|\ge 32$ and $\min\{δ(G),δ(G^c)\}\ge 4$, then either $G$ or $G^c$ has flow index strictly less than $3$. Our result is proved by a newly developed closure operation and contraction method.

math.CO↗

arXiv2018

Circular Flows in Planar Graphs

For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular $(2+\frac{2}{k})$-flow. The cases $k=1$ and $k=2$ are equivalent to the Four Color Theorem and Grötzsch's 3-Color Theorem. For $k\ge 3$, the conjecture remains open. Here we make progress when $k=4$ and $k=6$. We prove that (i) {\em every 10-edge-connected planar graph admits a circular 5/2-flow} and (ii) {\em every 16-edge-connected planar graph admits a circular 7/3-flow.} The dual version of statement (i) on circular coloring was previously proved by Dvořák and Postle (Combinatorica 2017), but our proof has the advantages of being much shorter and avoiding the use of computers for case-checking. Further, it has new implications for antisymmetric flows. Statement (ii) is especially interesting because the counterexamples to Jaeger's original Circular Flow Conjecture are 12-edge-connected nonplanar graphs that admit no circular 7/3-flow. Thus, the planarity hypothesis of (ii) is essential.

math.CO↗

arXiv2017

Nowhere-zero $3$-flow of graphs with small independence number

Tutte's $3$-flow conjecture states that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In this paper, we characterize all graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow. The characterization of $3$-flow verifies Tutte's $3$-flow conjecture for graphs with independence number at most $4$ and with order at least $21$. In addition, we prove that every odd-$5$-edge-connected graph with independence number at most $3$ admits a nowhere-zero $3$-flow. To obtain these results, we introduce a new reduction method to handle odd wheels.

math.CO↗

arXiv2017

Odd induced subgraphs in graphs with treewidth at most two

A long-standing conjecture asserts that there exists a constant $c>0$ such that every graph of order $n$ without isolated vertices contains an induced subgraph of order at least $cn$ with all degrees odd. Scott (1992) proved that every graph $G$ has an induced subgraph of order at least $|V(G)|/(2χ(G))$ with all degrees odd, where $χ(G)$ is the chromatic number of $G$, this implies the conjecture for graphs with { bounded} chromatic number. But the factor $1/(2χ(G))$ seems to be not best possible, for example, Radcliffe and Scott (1995) proved $c=\frac 23$ for trees, Berman, Wang and Wargo (1997) showed that $c=\frac 25$ for graphs with maximum degree $3$, so it is interesting to determine the exact value of $c$ for special family of graphs. In this paper, we further confirm the conjecture for graphs with treewidth at most 2 with $c=\frac{2}{5}$, and the bound is best possible.

math.CO↗

arXiv2016

Nowhere-zero $3$-flow and $\mathbb{Z}_3$-connectedness in Graphs with Four Edge-disjoint Spanning Trees

Given a zero-sum function $β: V(G) \rightarrow \mathbb{Z}_3$ with $\sum_{v\in V(G)}β(v)=0$, an orientation $D$ of $G$ with $d^+_D(v)-d^-_D(v)= β(v)$ in $\mathbb{Z}_3$ for every vertex $v\in V(G)$ is called a $β$-orientation. A graph $G$ is $\mathbb{Z}_3$-connected if $G$ admits a $β$- orientation for every zero-sum function $β$. Jaeger et al. conjectured that every $5$-edge-connected graph is $\mathbb{Z}_3$-connected. A graph is $\langle\mathbb{Z}_3\rangle$-extendable at vertex $v$ if any pre-orientation at $v$ can be extended to a $β$-orientation of $G$ for any zero-sum function $β$. We observe that if every $5$-edge-connected essentially $6$-edge-connected graph is $\langle\mathbb{Z}_3\rangle$-extendable at any degree five vertex, then the above mentioned conjecture by Jaeger et al. holds as well. Furthermore, applying the partial flow extension method of Thomassen and of Lovász et al., we prove that every graph with at least 4 edge-disjoint spanning trees is $\mathbb{Z}_3$-connected. Consequently, every $5$-edge-connected essentially $23$-edge-connected graph is $\langle\mathbb{Z}_3\rangle$-extendable at degree five vertex.

math.CO↗