On a counterexample to a conjecture of Saint Venant
โ Scribed by Mythily Ramaswamy
- Publisher
- Springer Netherlands
- Year
- 1992
- Tongue
- English
- Weight
- 281 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0374-3535
No coin nor oath required. For personal study only.
โฆ Synopsis
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~ = {(x, y) ~ f~; u(x, y) > ~}, which again is convex. We give a totally different proof of this claim. Our proof brings out clearly the reason for the failure of the conjecture and also allows us to construct many more such domains.
๐ SIMILAR VOLUMES
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.
We give a counterexample to the following conjecture of Douglas D. Grant Cl]: If a positive integer t 3 2 and D is a strict digraph of order 2t such that S+(D) 3 t and S'(D)2 t, then D has an anti-directed hamiltonian cycle. Where S+(D) and 6-(D) denote the minimum indegree and outdegree, respective