Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.01493v2

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2306.01493v2 (math)
[Submitted on 2 Jun 2023 (v1) , last revised 20 Jun 2023 (this version, v2)]

Title: On Fan's conjecture about $4$-flow

Title: 关于Fan关于$4$流的猜想

Authors:Deping Song, Shuang Li, Xiao Wang
Abstract: Let $G$ be a bridgeless graph, $C$ is a circuit of $G$. Fan proposed a conjecture that if $G/C$ admits a nowhere-zero 4-flow, then $G$ admits a 4-flow $(D,f)$ such that $E(G)-E(C)\subseteq$ supp$(f)$ and $|\textrm{supp}(f)\cap E(C)|>\frac{3}{4}|E(C)|$. The purpose of this conjecture is to find shorter circuit cover in bridgeless graphs. Fan showed that the conjecture holds for $|E(C)|\le19.$ Wang, Lu and Zhang showed that the conjecture holds for $|E(C)|\le 27$. In this paper, we prove that the conjecture holds for $|E(C)|\le 35.$
Abstract: 设 $G$ 是一个无桥图, $C$ 是 $G$ 的一个环。 范提出一个猜想,如果$G/C$允许一个非零的4流,则$G$允许一个4流$(D,f)$使得$E(G)-E(C)\subseteq$支持$(f)$并且$|\textrm{supp}(f)\cap E(C)|>\frac{3}{4}|E(C)|$。这个猜想的目的是在无桥图中找到更短的环覆盖。 范证明了该猜想对于$|E(C)|\le19.$成立,王、卢和张证明了该猜想对于$|E(C)|\le 27$成立。在本文中,我们证明了该猜想对于$|E(C)|\le 35.$成立。
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2306.01493 [math.CO]
  (or arXiv:2306.01493v2 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2306.01493
arXiv-issued DOI via DataCite

Submission history

From: Song Deping [view email]
[v1] Fri, 2 Jun 2023 12:42:01 UTC (12 KB)
[v2] Tue, 20 Jun 2023 04:50:15 UTC (12 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号