𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Counterexample to a Theorem of Xu

✍ Scribed by Ljubomir Ćirić


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
123 KB
Volume
213
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A Lot of “Counterexamples” to Liouville'
✍ Luis Bernal-González 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We prove in this paper that, given ␣ g 0, 1r2 , there exists a linear manifold M of entire functions satisfying that M is dense in the space of all entire functions Ž< < ␣ . Ž j. Ž . and, in addition, lim exp z f z s0 on any plane strip for every f g M z ª ϱ and for every derivation index j. Moreove

A counterexample to the bold conjecture
✍ Sakuma, Tadashi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

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

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 a conjecture on path
✍ Stephanie M. Boyles; Geoffrey Exoo 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract In a recent paper Lovász, Neumann‐Lara, and Plummer studied Mengerian theorems for paths of bounded length. Their study led to a conjecture concerning the extent to which Menger's theorem can fail when restricted to paths of bounded length. In this paper we offer counterexamples to this