中文
相关论文

相关论文: On building 4-critical plane and projective plane …

200 篇论文

An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane such that the lengths of the edges are odd…

组合数学 · 数学 2020-08-25 Gábor Damásdi

We show that every quadrangulation of the sphere can be transformed into a $4$-cycle by deletions of degree-$2$ vertices and by $t$-contractions at degree-$3$ vertices. A $t$-contraction simultaneously contracts all incident edges at a…

组合数学 · 数学 2017-03-14 Elke Fuchs , Laura Gellert

4-critical wheel graphs of higher order are considered concerning their belonging to free-planar or free-Hadwiger classes.

组合数学 · 数学 2011-06-08 Dainis Zeps

A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…

组合数学 · 数学 2022-08-26 János Karl , Géza Tóth

We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…

代数几何 · 数学 2015-07-30 Sergey Finashin , Viatcheslav Kharlamov

We show that the wheel classes in the Kontsevich graph complex $GC_d$ admit representatives supported on graphs with only $3$- and $4$-valent vertices. This verifies that Merkulov's low-valence conjecture holds for the wheel classes. More…

量子代数 · 数学 2026-05-21 Assar Andersson

An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45 degrees line-segments. For such drawings to be readable, special care is needed in order to keep the number…

计算几何 · 计算机科学 2015-12-16 Michael A. Bekos , Michael Kaufmann , Robert Krug

We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently…

In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may…

计算几何 · 计算机科学 2022-09-01 Sabine Cornelsen , Gregor Diatzko

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are…

几何拓扑 · 数学 2007-05-23 M. Deza , M. Dutour , M. Shtogrin

We construct a collection of higher Chow cycles on certain surfaces which degenerate to an arrangement of planes in general position. When its degree is 4, this construction gives a new explicit proof of the Hodge-D-Conjecture for a certain…

代数几何 · 数学 2021-06-08 Tokio Sasaki

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

组合数学 · 数学 2019-01-07 Songpon Sriwongsa

We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For $c=1$ there are only two such graphs without degree-2 vertices, $K_5$ and $K_{3,3}$, but for any fixed…

组合数学 · 数学 2026-05-08 Zdeněk Dvořák , Petr Hliněný , Bojan Mohar

In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…

组合数学 · 数学 2025-07-31 Maria Chudnovsky , David Fischer , Sepehr Hajebi , Sophie Spirkl , Bartosz Walczak

We introduce a new technique that is used to show that the complex projective plane blown up at 6, 7, or 8 points has infinitely many distinct smooth structures. None of these smooth structures admit smoothly embedded spheres with…

几何拓扑 · 数学 2007-05-23 Ronald Fintushel , Ronald J. Stern

We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…

组合数学 · 数学 2023-03-31 Johannes Carmesin , Tsvetomir Mihaylov

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 $\tfrac12\,(1+\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$…

组合数学 · 数学 2018-08-06 Louis Esperet , Matěj Stehlík

For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…

几何拓扑 · 数学 2024-06-14 R. Inanc Baykur , Andras I. Stipsicz , Zoltan Szabo

A classical result asserts that the complex projective plane modulo complex conjugation is the 4-dimensional sphere. We generalize this result in two directions by considering the projective planes over the normed real division algebras and…

微分几何 · 数学 2007-05-23 Michael Atiyah , Jurgen Berndt

We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…

计算几何 · 计算机科学 2012-09-04 Micha Sharir , Adam Sheffer
‹ 上一页 1 2 3 10 下一页 ›