Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.24427

Local Ore Conditions for Rainbow Pancyclicity and Vertex-Pancyclicity in Graph Systems

Ailian Chen·Jiahuang Lin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate rainbow pancyclicity and vertex-pancyclicity of graph systems satisfying a local Ore-type degree condition. All graphs in the system share the same vertex set. We prove that if each graph is 2-connected and satisfies our local Ore condition, then the graph system is either rainbow pancyclic and vertex-pancyclic for cycles of length from 4 to n, or all graphs are identical balanced complete bipartite graphs on an even vertex set. A stronger degree threshold ensures full rainbow vertex-pancyclicity. All thresholds we obtain are tight. Our proofs rely on cycle extension techniques and neighborhood separation arguments.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ailian Chen, Jiahuang Lin. 2026-10-17. Local Ore Conditions for Rainbow Pancyclicity and Vertex-Pancyclicity in Graph Systems. https://arxiv.org/abs/2610.24427

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

KEEP EXPLORING

Related papers

arXiv2026

Two Erdos-Hajnal-type theorems for forbidden order-size pairs

The celebrated Erdős-Hajnal conjecture says that any graph without a fixed induced subgraph $H$ contains a very large homogeneous set. A direct analog of this conjecture is not true for hypergraphs. In this paper we present two natural variants of this problem which do hold for hypergraphs. We show that for every $r \geq 3$, $m \geq m_0(r)$ and $0 \leq f \leq \binom{m}{r}$, if an $r$-graph $G$ does not contain $m$ vertices spanning exactly $f$ edges, then $G$ contains much larger homogeneous sets than what is guaranteed to exist in general $r$-graphs. We also prove that if a $3$-graph $G$ does not contain homogeneous sets of polynomial size, then for every $m \geq 3$ there are $Ω(m^3)$ values of $f$ such that $G$ contains $m$ vertices spanning exactly $f$ edges. This makes progress on a problem of Axenovich, Bradač, Gishboliner, Mubayi and Weber.

math.CO↗
arXiv2026

Unexpectedly, a symmetry on unlabeled graphs

We exhibit the joint symmetric distribution of the following two parameters on the set of unlabeled, simple, connected graphs with $n$ vertices. The first parameter is the maximal number of leaves attached to a vertex. The second parameter is the size of the largest set of vertices sharing the same closed neighborhood minus $1$. Apparently, this is the first example of a natural, non-trivial equidistribution of graph parameters on unlabeled connected graphs on a fixed set of vertices. Our proof is enumerative, using the theory of species. Exhibiting an explicit bijection interchanging the two parameters remains an open problem.

math.CO↗
arXiv2026

Cycle lengths in the percolated hypercube

Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$ such that, if $pd\ge c$, then typically $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. We strengthen this result to show that, under the same assumptions, typically $Q^d_p$ contains cycles of all even lengths between $4$ and $(1-\varepsilon)2^d$.

math.CO↗