✦ LIBER ✦

The variety of triangular embeddings of a graph in the projective plane

✍ Scribed by Serge Lawrencenko

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 609 KB
Volume: 54
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90051-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding the complement of a minimal bl

Embedding the complement of a minimal blocking set in a projective plane

✍ Lynn Margaret Batten 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 373 KB

A blocking set B in a projective plane z of order n is a subset of T which meets every line but contains no line completely. Hence le)B n I] srz for every line i of 9r.I A blocking set is minimal if it contains no proper blocking set. A blocking set is maximal if it is not properly contained in any

On the number of triangular embeddings o

On the number of triangular embeddings of complete graphs and complete tripartite graphs

✍ M. J. Grannell; M. Knor 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__→∞, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many

Embeddings of Curves in the Plane

✍ Vladimir Shpilrain; Jie-Tai Yu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 88 KB

## w x Let K x, y be the polynomial algebra in two variables over a field K of characteristic 0. In this paper, we contribute toward a classification of two-variable Ž w x. polynomials by classifying up to an automorphism of K x, y polynomials of the e., polynomials whose New- . ton polygon is e

Graphs embedded in the plane with a boun

Graphs embedded in the plane with a bounded number of accumulation points

✍ C. Paul Bonnington; R. Bruce Richter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in

The Projective Noether Maple Package: Co

The Projective Noether Maple Package: Computing the Dimension of a Projective Variety

✍ Marc Giusti; Klemens Hägele; Grégoire Lecerf; Joël Marchand; Bruno Salvy 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Recent theoretical advances in elimination theory use straight-line programs as a data structure to represent multivariate polynomials. We present here the Projective Noether Package which is a Maple implementation of one of these new algorithms, yielding as a byproduct a computation of the dimensio

Embedding the complement of an oval in a

Embedding the complement of an oval in a projective plane of even order

✍ R.C. Bose; S.S. Shrikhande 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 729 KB

A configuration D with parameters (u, b, r. k) is an incidence structure t P, B. 2 L where ? is a set of u "points'\*, 8 is a set of b '"blocks" and 7 is an 'incidence relation" between points and blocks such that each point is incident with t blocks, and each blok is incident with Fc points. A bloc