Skip to content
/ GraphSplitter Public

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

en.wikipedia.org/wiki/Linear_arboricity
0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

zoffyzhang/GraphSplitter

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
.settings
.settings
 
 
bin
bin
 
 
result
result
 
 
src
src
 
 
test
test
 
 
.classpath
.classpath
 
 
.gitignore
.gitignore
 
 
.project
.project
 
 
README.md
README.md
 
 

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

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

en.wikipedia.org/wiki/Linear_arboricity

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages