共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we shall prove that a projective‐planar (resp., toroidal) triangulation G has K6 as a minor if and only if G has no quadrangulation isomorphic to K4 (resp., K5 ) as a subgraph. As an application of the theorems, we can prove that Hadwiger's conjecture is true for projective‐planar and toroidal triangulations. © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 302‐312, 2009 相似文献
2.
3.
4.
5.
A graph with at least vertices is said to be distance -extendable if, for any matching of with edges in which the edges lie at distance at least pairwise, there exists a perfect matching of containing . In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 -extendable for any . 相似文献
6.
Atsuhiro Nakamoto 《Journal of Graph Theory》1999,30(3):223-234
In this article, we show that all quadrangulations of the sphere with minimum degree at least 3 can be constructed from the pseudo‐double wheels, preserving the minimum degree at least 3, by a sequence of two kinds of transformations called “vertex‐splitting” and “4‐cycle addition.” We also consider such generating theorems for other closed surfaces. These theorems can be translated into those of 4‐regular graphs on surfaces by taking duals. © 1999 John Wiley & Sons, In. J Graph Theory 30: 223–234, 1999 相似文献
7.
8.
We shall determine the 20 families of irreducible even triangulations of the projective plane. Every even triangulation of the projective plane can be obtained from one of them by a sequence of even‐splittings and attaching octahedra, both of which were first given by Batagelj 2 . © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 333–349, 2007 相似文献
9.
Kelly B. Houston Robert C. Powers 《International Journal of Mathematical Education in Science & Technology》2013,44(8):1085-1091
In 1992, Klamkin and Liu proved a very general result in the Extended Euclidean Plane that contains the theorems of Ceva and Menelaus as special cases. In this article, we extend the Klamkin and Liu result to projective planes PG(2, 𝔽) where 𝔽 is a field. 相似文献
10.
Rowena Held Iva Stavrov Brian VanKoten 《Differential Geometry and its Applications》2009,27(4):464-481
We use reduced homogeneous coordinates to construct and study the (semi-)Riemannian geometry of the octonionic (or Cayley) projective plane , the octonionic projective plane of indefinite signature , the para-octonionic (or split octonionic) projective plane and the hyperbolic dual of the octonionic projective plane . We also show that our manifolds are isometric to the (para-)octonionic projective planes defined classically by quotients of Lie groups. 相似文献
11.
William M. Kantor 《Journal of Algebraic Combinatorics》1994,3(4):405-425
Translation planes of order q are constructed whose full collineation groups have order q
2. 相似文献
12.
In this paper, we show that there are at least cq disjoint blocking sets in PG(2,q), where c ≈ 1/3. The result also extends to some non‐Desarguesian planes of order q. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 149–158, 2006 相似文献
13.
Bruen and Thas proved that the size of a large minimal blocking set is bounded by . Hence, if q = 8, then the maximal possible size is 23. Since 8 is not a square, it was conjectured that a minimal blocking 23‐set does not exist in PG(2,8). We show that this is not the case, and construct such a set. We prove that this is combinatorially unique. We also complete the spectrum problem of minimal blocking sets for PG(2,8) by showing a minimal blocking 22‐set. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 162–169, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10035 相似文献
14.
We prove that the Cayley hyperbolic plane admits no Einstein hypersurfaces and that the only Einstein hypersurfaces in the Cayley projective plane are geodesic spheres of a certain radius; this completes the classification of Einstein hypersurfaces in rank-one symmetric spaces. 相似文献
15.
Nicholas Hamilton 《Journal of Combinatorial Theory, Series A》2002,100(2):265
In a recent paper R. Mathon gave a new construction method for maximal arcs in finite Desarguesian projective planes that generalised a construction of Denniston. He also gave several instances of the method to construct new maximal arcs. In this paper, the structure of the maximal arcs is examined to give geometric and algebraic methods for proving when the maximal arcs are not of Denniston type. New degree 8 maximal arcs are also constructed in PG(2,2h), h5, h odd. This, combined with previous results, shows that every Desarguesian projective plane of (even) order greater that 8 contains a degree 8 maximal arc that is not of Denniston type. 相似文献
16.
Using symplectic topology and the Radon transform, we prove that smooth 4-dimensional projective planes are diffeomorphic
to
. We define the notion of a plane curve in a smooth projective plane, show that plane curves in high dimensional regular planes
are lines, prove that homeomorphisms preserving plane curves are smooth collineations, and prove a variety of results analogous
to the theory of classical projective planes.
*Thanks to Robert Bryant and John Franks. 相似文献
17.
设G Aut(D)且Soc(G) =Sz(q) ,这里q=2 p,p为奇素数,若有Sz(q) 相似文献
18.
An edge‐face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1–3):21–33, 1994] proved that every plane graph of maximum degree Δ?10 can be edge‐face colored with Δ + 1 colors. We extend Borodin's result to the case where Δ = 9. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:332‐346, 2011 相似文献
19.
《Journal of Graph Theory》2018,89(1):76-88
We show that every 4‐chromatic graph on n vertices, with no two vertex‐disjoint odd cycles, has an odd cycle of length at most . Let G be a nonbipartite quadrangulation of the projective plane on n vertices. Our result immediately implies that G has edge‐width at most , which is sharp for infinitely many values of n. We also show that G has face‐width (equivalently, contains an odd cycle transversal of cardinality) at most , which is a constant away from the optimal; we prove a lower bound of . Finally, we show that G has an odd cycle transversal of size at most inducing a single edge, where Δ is the maximum degree. This last result partially answers a question of Nakamoto and Ozeki. 相似文献
20.
J.A. Thas 《Journal of Algebraic Combinatorics》1992,1(1):97-102
A unital U with parameter q is a 2 – (q
3 + 1, q + 1, 1) design. If a point set U in PG(2, q
2) together with its (q + 1)-secants forms a unital, then U is called a Hermitian arc. Through each point p of a Hermitian arc H there is exactly one line L having with H only the point p in common; this line L is called the tangent of H at p. For any prime power q, the absolute points and nonabsolute lines of a unitary polarity of PG(2, q
2) form a unital that is called the classical unital. The points of a classical unital are the points of a Hermitian curve in PG(2, q
2).Let H be a Hermitian arc in the projective plane PG(2, q
2). If tangents of H at collinear points of H are concurrent, then H is a Hermitian curve. This result proves a well known conjecture on Hermitian arcs. 相似文献