English
Related papers

Related papers: Homological face-width condition forcing $K_6$-min…

200 papers

We give necessary and sufficient conditions for a closed smooth 6-manifold N to be diffeomorphic to a product of a surface F and a simply connected 4-manifold M in terms of basic invariants like the fundamental group and cohomological data.…

Geometric Topology · Mathematics 2017-08-29 Ian Hambleton , Matthias Kreck

By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the…

Combinatorics · Mathematics 2011-07-19 Gareth A. Jones , Young Soo Kwon

We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K_{4,k}, the graph obtained from a cycle of length 2k+1 by adding an edge…

Combinatorics · Mathematics 2010-11-11 Guoli Ding , Bogdan Oporowski , Robin Thomas , Dirk Vertigan

The purpose of this paper is to characterize graphs that do not have a large $K_{2,n}$-minor. As corollaries, it is proved that, for any given positive integer $n$, every sufficiently large 3-connected graph with minimum degree at least…

Combinatorics · Mathematics 2017-02-07 Guoli Ding

A signed bipartite (simple) graph $(G, \sigma)$ is said to be $C_{-4}$-critical if it admits no homomorphism to $C_{-4}$ (a negative 4-cycle) but every proper subgraph of it does. In this work, first of all we show that the notion of…

Combinatorics · Mathematics 2021-11-23 Reza Naserasr , Lan Anh Pham , Zhouningxin Wang

Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if there is no homeomorphic embedding of the Petersen graph in…

Combinatorics · Mathematics 2014-03-11 Neil Robertson , Paul Seymour , Robin Thomas

Work of Glover and Huneke shows that a cubic graph embeds into the real projective plane if and only if it does not contain one of six topological minors called cubic projective plane obstructions. Here we classify up to equivalence the…

Combinatorics · Mathematics 2024-10-01 Marie Kramer

We present problems and results that combine graph-minors and coarse geometry. For example, we ask whether every geodesic metric space (or graph) without a fat $H$ minor is quasi-isometric to a graph with no $H$ minor, for an arbitrary…

Combinatorics · Mathematics 2025-03-18 Agelos Georgakopoulos , Panos Papasoglu

Hadwiger's Conjecture from 1943 states that every graph with no $K_{t}$ minor is $(t-1)$-colorable; it remains wide open for all $t\ge 7$. For positive integers $t$ and $s$, let $\mathcal{K}_t^{-s}$ denote the family of graphs obtained from…

Combinatorics · Mathematics 2022-08-23 Michael Lafferty , Zi-Xia Song

A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…

Geometric Topology · Mathematics 2026-02-27 A. Skopenkov , O. Styrt

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

Combinatorics · Mathematics 2014-01-14 Rajneesh Hegde , Robin Thomas

Cubic planar $n$-vertex graphs with faces of length at most $6$, e.g., fullerene graphs, have diameter in $\Omega(\sqrt{n})$. It has been suspected, that a similar result can be shown for cubic planar graphs with faces of bounded length.…

Combinatorics · Mathematics 2019-08-26 Kolja Knauer , Piotr Micek

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…

Combinatorics · Mathematics 2017-07-18 Vida Dujmović , David Eppstein , David R. Wood

A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially…

Discrete Mathematics · Computer Science 2016-08-16 Fédéric Havet , Jean-Sébastien Sereni , Riste Skrekovski

We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided $K_{_5}$ or a $K^-_{_4}$ (= $K_{_4}$ with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu that {\sl every nonplanar…

Combinatorics · Mathematics 2010-12-30 Elad Aigner-Horev , Roi Krakovski

We consider the isometric deformation problem for oriented non simply connected immersed minimal surfaces $f:M \to S^{4}$. We prove that the space of all isometric minimal immersions of $M$ into $S^{4}$ with the same normal curvature…

Differential Geometry · Mathematics 2012-03-01 Theodoros Vlachos

A graph is $k$-gap-planar if it has a drawing in the plane such that every crossing can be charged to one of the two edges involved so that at most $k$ crossings are charged to each edge. We show this class of graphs has linear expansion.…

Combinatorics · Mathematics 2025-10-21 David R. Wood

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

Combinatorics · Mathematics 2013-05-10 Julia Böttcher , Anusch Taraz , Andreas Würfl

Let ${\rm ex \,} {\mathcal B}$ be a minor-closed class of graphs with a set ${\mathcal B}$ of minimal excluded minors. We study (a) the asymptotic number of graphs without $k+1$ disjoint minors in ${\mathcal B}$ and (b) the properties of a…

Combinatorics · Mathematics 2019-07-16 Valentas Kurauskas

We disprove the conjecture of Georgakopoulos and Papasoglu that a length space (or graph) with no $K$-fat $H$ minor is quasi-isometric to a graph with no $H$ minor. Our counterexample is furthermore not quasi-isometric to a graph with no…

Combinatorics · Mathematics 2024-05-16 James Davies , Robert Hickingbotham , Freddie Illingworth , Rose McCarty
‹ Prev 1 3 4 5 6 7 10 Next ›