Leandro F. Aurichi

activity

20142024

collaborators

3 papers

math.CO2024

Remarks on the countable case of the Unfriendly Partition Problem

Leandro Fiorini Aurichi, Lucas Real

The Unfriendly Partition Problem asks whether it is possible to split the vertex set of an infinite graph $G$ into two parts so that every vertex has at least as many neighbors in…

math.CO2023

Unfriendly partitions when avoiding vertices of finite degree

Leandro Fiorini Aurichi, Lucas Real

An unfriendly partition of a graph $G = (V, E)$ is a function $c : V \to 2$ such that $∣ {x \in N (v) : c (x) \neq = c (v)} ∣ \geq ∣ {x \in N (v) : c (x) = c (v)} ∣$ for every vertex $v \in V$ , where…

math.GN2014

When is a space Menger at infinity?

Leandro F. Aurichi, Angelo Bella

We try to characterize those Tychonoff spaces $X$ such that $β X ∖ X$ has the Menger property.