๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A counterexample to a conjecture on order statistics

โœ Scribed by Luning Li

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
109 KB
Volume
19
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Counterexample to a conjecture on Hamilt
Counterexample to a conjecture on Hamilton cycles
โœ P Paulraja ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 65 KB

We disprove the following conjecture: Let G be a 2-connected graph with minimum degree n on atmost 3n -2 vertices. Then G is hamiltonian if it has a 2-factor.

On a counterexample to a conjecture of S
On a counterexample to a conjecture of Saint Venant
โœ Mythily Ramaswamy ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 281 KB

The Saint Venant's conjecture for convex plane domains f~, having symmetry about two orthogonal axes, is that the maximum of [Vu[ occurs only at the points on df~ which are nearest to the origin. G. Sweers constructed one such domain f~ and claimed that either the conjecture fails for f~ or for f~ =

A counterexample to the bold conjecture
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