Related papers: Homological face-width condition forcing $K_6$-min…
For an embedded singly periodic minimal surface M with genus bigger than or equal to 4 and annular ends, some weak symmetry hypotheses imply its congruence with one of the Hoffman-Wohlgemuth examples. We give a very geometrical proof of…
We provide a complete structural characterization of $K_{2,4}$-minor-free graphs. The $3$-connected $K_{2,4}$-minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains…
Archdeacon (1987) proved that graphs embeddable on a fixed surface can be $3$-coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, Oum and Seymour (2015) proved that graphs with no…
Let K be the family of graphs on omega_1 without cliques or independent subsets of size omega_1 . We prove that: 1) it is consistent with CH that every G in K has 2^{omega_1} many pairwise non-isomorphic subgraphs, 2) the following…
We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…
This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…
A graph $G$ is Pfaffian if it has an orientation such that each central cycle $C$ (i.e. $C$ is even and $G-V(C)$ has a perfect matching) has an odd number of edges directed in either direction of the cycle. The number of perfect matchings…
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
Given hypergraphs $F$ and $H$, an $F$-factor in $H$ is a set of vertex-disjoint copies of $F$ which cover all the vertices in $H$. Let $K^- _4$ denote the $3$-uniform hypergraph with $4$ vertices and $3$ edges. We show that for sufficiently…
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…
A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The…
A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$. If the coloring is required to be proper, then the upper bound for the…
For an equivariantly formal action of a compact torus $T$ on a smooth manifold $X$ with isolated fixed points we investigate the global homological properties of the graded poset $S(X)$ of face submanifolds. We prove that the condition of…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
The class of all even-hole-free graphs has unbounded tree-width, as it contains all complete graphs. Recently, a class of (even-hole, $K_4$)-free graphs was constructed, that still has unbounded tree-width [Sintiari and Trotignon, 2019].…
A signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges which corresponds to an assignment of signs to the edges: edges in $\Sigma$ are negative while edges not in $\Sigma$ are positive. A closed walk of a signed…