Skip to content

🤔 这个项目尝试暴力验证图的线性荫度猜想,但最终得出的结论是,这个猜想首先需要被数学证明,然后才能用代码进行验证

Notifications You must be signed in to change notification settings

zoffyzhang/GraphSplitter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Split graph to linear forest in order to verify the Linear Arboricity Conjecture (LAC).

LAC: ceil(∆/2) ≤ la(G) ≤ ceil((∆+1)/2)

About

🤔 这个项目尝试暴力验证图的线性荫度猜想,但最终得出的结论是,这个猜想首先需要被数学证明,然后才能用代码进行验证

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages