Searcharxiv⌕ Search

arXiv subjects

Zhanhe Zhang

Publications and source records attributed to Zhanhe Zhang.

5 recordsLinked to original sources

The cofinite regularity spectrum of $F$-irregular graphs

For a connected graph $F$, a graph $G$ is $F$-irregular if the numbers of copies of $F$ containing its vertices are pairwise distinct. We characterize which connected patterns admit regular $F$-irregular hosts of every sufficiently large degree. Stars admit no regular $F$-irregular host; for every other $F$, every sufficiently large integer $r$ is realized by a connected $r$-regular $F$-irregular graph of diameter two and order $r+o(r)$, optimal to first order. For triangles, and equivalently four-vertex paths in regular graphs, we construct such hosts of order less than $r+73r^{\log29/\log58}$ above an explicit threshold, with the constant reduced to $44$ for even $r$. Lexicographic words encode distinct rooted subgraph counts, while layered connections allow the common degree to be prescribed. Rooted-homomorphism expansions and spectral amplification establish separation for general patterns; an exact uniform-increment identity gives the quantitative triangle construction. The finite seed graphs are explicitly constructed, and their required rooted-count distinctions are verified by exact-arithmetic certificates.

math.CO↗

Regular $K_3$-Irregular Graphs of Every Regularity at Least Nine

For a vertex $v$ of a graph $G$, the triangle-degree $\operatorname{td}_G(v)$ is the number of triangles containing $v$. A graph is triangle-distinct, or $K_3$-irregular, if its vertex triangle-degrees are pairwise distinct. Chartrand, Erdős, and Oellermann asked whether a regular $K_3$-irregular graph exists. We prove that such graphs exist for every regularity $r\ge 9$. More precisely, for every integer $k\ge 15$ we construct a $2k$-regular triangle-distinct graph on $4k+2$ vertices; complementation gives a $(2k+1)$-regular example of the same order. The construction uses two antiregular threshold blocks joined by a zero-one matrix with prescribed margins, followed by matrix $2$-switches that preserve those margins. After a uniform reference perturbation, exactly three triangle-degree collisions remain. Switches chosen according to parity remove two of them, and the last possible collision is controlled by a short quadratic discriminant argument. Odd $k\ge 17$ and even $k\ge 62$ are handled symbolically, while the remaining 24 values are settled by exact finite verification. Together with the known examples for $9\le r\le 29$, this closes the positive existence problem for every $r\ge 9$.

math.CO↗

Spectral Extremal 1-Planar Graphs with Bounded Pentagon Packing

Let $\mathcal P_1$ denote the class of 1-planar graphs and let $tC_5$ be the disjoint union of $t$ copies of $C_5$. For every fixed $t\ge3$ and all sufficiently large $n$, we determine the unique $n$-vertex $tC_5$-free graph in $\mathcal P_1$ with maximum adjacency spectral radius, answering Problem 1 of Li, Wang and Zhao. The proof first gives a structural description of every extremizer. After two dominating vertices are removed, the remainder consists of copies of the seven-vertex graph $B=K_1\vee2K_3$ together with at most one bounded connected core. This follows from a two-family covering theorem for 1-planar $K_2$-joins and the sharp packing--defect inequality \[ 12v(Q)-7e(Q)\ge1-10ν_5(Q). \] The same inequality yields an exact edge-extremal result for remainders with bounded pentagon packing. A normalized resolvent then cancels the repeated $B$-components, and finite moment comparisons force all packing and all nonzero defect into one core and identify that core uniquely in each residue class modulo $7$. The case $t=3$ is the pentagon-free boundary case and is completed by one exact finite component lemma.

math.CO↗

Multiple Hypothesis Flow Estimation for Video Frame Interpolation under Matching Ambiguity

Many flow-based video frame interpolation (VFI) methods synthesize an intermediate frame by estimating optical flow fields, warping the two input frames, and blending the warped observations. These latent flow fields are typically learned through image-level reconstruction supervision without direct flow annotations. In ambiguous regions containing repetitive or stochastic textures, rotating symmetric structures, or fast motion with blur, the matching evidence for a single query may contain multiple comparable and spatially separated peaks. Although the ground-truth intermediate frame provides indirect supervision, it may not uniquely identify the latent correspondence in ambiguous regions.When several locations provide multiple plausible matches, a single-flow estimator can retain only one displacement and discard the remaining candidates. If the selected match is incorrect or inconsistent with those of neighboring pixels, warping samples content from mismatched locations, producing ghosting, structural distortion, or blur.To address this limitation, we propose a multiple hypothesis flow estimation framework that preserves top-K candidate correspondences and selects one per location through a reliability-guided router. Each hypothesis is initialized from a coarse matching anchor and refined separately through anchor-centered local attention. Frame synthesis is thus conditioned on one selected flow-appearance hypothesis rather than a soft combination of candidate motions.Experiments on the proposed MA-HD benchmark and public VFI benchmarks show that our method achieves the best LPIPS and DISTS among the compared methods.

cs.CV↗

Perceive, Verify and Understand Long Video: Multi-Granular Perception and Active Verification via Interactive Agents

Long videos, characterized by temporal complexity and sparse task-relevant information, pose significant reasoning challenges for AI systems. Although existing Large Language Model (LLM)-based approaches have advanced long video understanding, they remain bottlenecked by task-agnostic, fixed-granularity perception pipelines and suffer from vision-language hallucinations. Inspired by human adaptive perception and active verification, we propose CogniGPT, a framework leveraging an interactive loop between a Multi-Granular Perception Agent (MPA) and an Active Verification Agent (AVA). Specifically, instead of predetermined heuristics, MPA adaptively determines the optimal perception granularity and strategy based on the evolving context, while AVA actively mines multi-perspective visual evidence to cross-verify key observations and eliminate hallucinations. This interaction allows CogniGPT to efficiently identify a minimal set of reliable task-related clues. Extensive experiments on EgoSchema, Video-MME, NExT-QA, and MovieChat demonstrate its superiority in accuracy and efficiency. Notably, on EgoSchema, it surpasses existing training-free methods using only 11.2 frames and achieves performance comparable to Gemini 1.5-Pro.

cs.CV↗