Related papers: Relative phantom maps

In the first part, we determine conditions on spectra X and Y under which either every map from X to Y is phantom, or no nonzero maps are. We also address the question of whether such all or nothing behaviour is preserved when X is replaced…

A phantom map is a potentially nontrivial map which induces the zero map on every homology theory and on homotopy groups. Zabrodsky has shown that in the presence of particular finiteness conditions on spaces $X$ and $Y$ every map $X\to Y$…

We generalize some results of Gray and McGibbon-Roitberg on relations between phantom maps and rational homotopy to relative phantom maps. Since the $\lim^1$ and the profinite completion techniques do not apply to relative phantom maps, we…

We study phantom maps and homology theories in a stable homotopy category S via a certain Abelian category A. We express the group P(X,Y) of phantom maps X -> Y as an Ext group in A, and give conditions on X or Y which guarantee that it…

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…

Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

We study the Gray index of phantom maps, which is a numerical invariant of phantom maps. It is conjectured that the only phantom map with infinite Gray index between finite-type spaces is the constant map. We disprove this conjecture by…

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic…

An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…

A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring. We prove that, given $k,r>0$, there exists a $k$-connected common…

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…

Motivated by the work of Cantwell-Conlon-Fenley on endperiodic homeomorphisms of infinite type surfaces, we define and study endperiodic and generalized endperiodic maps of an infinite graph with finitely many ends. Adapting the work of…

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

For a graph $F$, let ${\rm EX}(n,F)$ be the set of $F$-free graphs of order $n$ with the maximum number of edges. The graph $F$ is called vertex-critical, if the deletion of its some vertex induces a graph with smaller chromatic number. For…

We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.

We generalize theorems of McGibbon-Roitberg, Iriye, and Meier on the relations between phantom maps and rational homotopy, and apply them to provide new calculational examples of the homotopy sets Ph(X, Y ) of phantom maps and the subsets…