✦ LIBER ✦

On a Minimal Counterexample to Dade's Projective Conjecture

✍ Scribed by Charles W. Eaton; Geoffrey R. Robinson

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 96 KB
Volume: 249
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.2001.8989

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A counterexample to Seymour's self-minor

A counterexample to Seymour's self-minor conjecture

✍ Bogdan Oporowski 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

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

On possible counterexamples to Negami's

On possible counterexamples to Negami's planar cover conjecture

✍ Petr Hliněný; Robin Thomas 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

## Abstract A simple graph **__H__** is a cover of a graph **__G__** if there exists a mapping φ from **__H__** onto **__G__** such that φ maps the neighbors of every vertex υ in **__H__** bijectively to the neighbors of φ (υ) in **__G__**. Negami conjectured in 1986 that a connected graph has a fi

A counterexample to a conjecture on path

A counterexample to a conjecture on paths of bounded length

✍ 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

A Counterexample to Fulton's Conjecture

A Counterexample to Fulton's Conjecture on [formula]0, n

✍ Peter Vermeire 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 67 KB

We describe an elementary counterexample to a conjecture of Fulton on the set of effective divisors on the space M 0 n of marked rational curves.  2002 Elsevier Science (USA)

A counterexample to the rank-coloring co

A counterexample to the rank-coloring conjecture

✍ 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.