A pair of vertices (x, y) of a graph G is an ω-critical pair if ω(G + xy) > ω(G), where G + xy denotes the graph obtained by adding the edge xy to G and ω(H) is the clique number of H. The ω-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S mee
✦ LIBER ✦
A weak counterexample to the Carathéodory conjecture
✍ Scribed by Larry Bates
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 14 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0926-2245
No coin nor oath required. For personal study only.
✦ Synopsis
We construct a closed surface with a single topological umbilic point of index two.
📜 SIMILAR VOLUMES
A counterexample to the bold conjecture
✍
Sakuma, Tadashi
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 83 KB
👁 1 views
A counterexample to the paramagnetic con
✍
J. Avron; B. Simon
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 174 KB
A counterexample to the triangle conject
✍
P.W Shor
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 107 KB
A Comparison of the Carathéodory and Fil
✍
John S. Spraker
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 139 KB
A counterexample to the rank-coloring co
✍
N. Alon; P. D. Seymour
📂
Article
📅
1989
🏛
John Wiley and Sons
🌐
English
⚖ 140 KB
It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.
A counterexample to the Lazer–McKenna co
✍
E.N. Dancer
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 246 KB