2001
DOI: 10.1016/s0304-3975(00)00255-3
|View full text |Cite
|
Sign up to set email alerts
|

An improvement on a spernerity proof of Horrocks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2008
2008
2008
2008

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Horrocks [8,9] gave a graph-theoretical interpretation for the t = 2 conjecture and left 116 exceptional graphs in his proof. Cheng and Lih [2] carried on further with Horrocks's reduction method to reduce the number of exceptional graphs and gave a complete proof for the t = 2 conjecture. The conjecture remains open for t = 3.…”
Section: Remarksmentioning
confidence: 99%
“…Horrocks [8,9] gave a graph-theoretical interpretation for the t = 2 conjecture and left 116 exceptional graphs in his proof. Cheng and Lih [2] carried on further with Horrocks's reduction method to reduce the number of exceptional graphs and gave a complete proof for the t = 2 conjecture. The conjecture remains open for t = 3.…”
Section: Remarksmentioning
confidence: 99%