Graphs represented by Ext

Publication date: 21 October 2021

Abstract: This paper opens and discusses the question originally due to Daniel Herden, who asked for which graph

(m u, R)

we can find a family

m a t h b b G_{a} l p h a : a l p h a < m u

of abelian groups such that for each

:

Ext(mathbb G_alpha, mathbb G_�eta) = 0 Longleftrightarrow(alpha,�eta) in R.

In this regard, we present four results. First, we give a connection to Quillen's small object argument which helps

E x t

vanishes and uses to present useful criteria to the question. Suppose

l a m b d a = l a m b d a^{a l e p h_{0}}

and

m u = 2^{l} a m b d a

. We apply Jensen's diamond principle along with the criteria to present

l a m b d a

-free abelian groups representing bipartite graphs. Third, we use a version of the black box to construct in ZFC, a family of

a l e p h_{1}

-free abelian groups representing bipartite graphs. Finally, applying forcing techniques, we present a consistent positive answer for general graphs.

This page was built for publication: Graphs represented by Ext