64 research outputs found
Computing trisections of 4-manifolds
Algorithms that decompose a manifold into simple pieces reveal the geometric
and topological structure of the manifold, showing how complicated structures
are constructed from simple building blocks. This note describes a way to
algorithmically construct a trisection, which describes a -dimensional
manifold as a union of three -dimensional handlebodies. The complexity of
the -manifold is captured in a collection of curves on a surface, which
guide the gluing of the handelbodies. The algorithm begins with a description
of a manifold as a union of pentachora, or -dimensional simplices. It
transforms this description into a trisection. This results in the first
explicit complexity bounds for the trisection genus of a -manifold in terms
of the number of pentachora (-simplices) in a triangulation.Comment: 15 pages, 9 figure
A new bound for the 2/3 conjecture
We show that any n-vertex complete graph with edges colored with three colors
contains a set of at most four vertices such that the number of the neighbors
of these vertices in one of the colors is at least 2n/3. The previous best
value, proved by Erdos, Faudree, Gould, Gy\'arf\'as, Rousseau and Schelp in
1989, is 22. It is conjectured that three vertices suffice
On small Mixed Pattern Ramsey numbers
We call the minimum order of any complete graph so that for any coloring of
the edges by colors it is impossible to avoid a monochromatic or rainbow
triangle, a Mixed Ramsey number. For any graph with edges colored from the
above set of colors, if we consider the condition of excluding in the
above definition, we produce a \emph{Mixed Pattern Ramsey number}, denoted
. We determine this function in terms of for all colored -cycles
and all colored -cliques. We also find bounds for when is a
monochromatic odd cycles, or a star for sufficiently large . We state
several open questions.Comment: 16 page
- âŚ