518 research outputs found
Partitioning 3-colored complete graphs into three monochromatic cycles
We show in this paper that in every 3-coloring of the edges of Kn all but o(n)
of its vertices can be partitioned into three monochromatic cycles. From this, using
our earlier results, actually it follows that we can partition all the vertices into at
most 17 monochromatic cycles, improving the best known bounds. If the colors of
the three monochromatic cycles must be different then one can cover ( 3
4 â o(1))n
vertices and this is close to best possible
Parity balance of the -th dimension edges in Hamiltonian cycles of the hypercube
Let be an integer, and let . An -th dimension
edge in the -dimensional hypercube is an edge such that
differ just at their -th entries. The parity of an -th
dimension edge \edg{v_1}{v_2} is the number of 1's modulus 2 of any of its
vertex ignoring the -th entry. We prove that the number of -th dimension
edges appearing in a given Hamiltonian cycle of with parity zero
coincides with the number of edges with parity one. As an application of this
result it is introduced and explored the conjecture of the inscribed squares in
Hamiltonian cycles of the hypercube: Any Hamiltonian cycle in contains
two opposite edges in a 4-cycle. We prove this conjecture for , and
for any Hamiltonian cycle containing more than edges in the same
dimension. This bound is finally improved considering the equi-independence
number of , which is a concept introduced in this paper for bipartite
graphs
Graphs Identified by Logics with Counting
We classify graphs and, more generally, finite relational structures that are
identified by C2, that is, two-variable first-order logic with counting. Using
this classification, we show that it can be decided in almost linear time
whether a structure is identified by C2. Our classification implies that for
every graph identified by this logic, all vertex-colored versions of it are
also identified. A similar statement is true for finite relational structures.
We provide constructions that solve the inversion problem for finite
structures in linear time. This problem has previously been shown to be
polynomial time solvable by Martin Otto. For graphs, we conclude that every
C2-equivalence class contains a graph whose orbits are exactly the classes of
the C2-partition of its vertex set and which has a single automorphism
witnessing this fact.
For general k, we show that such statements are not true by providing
examples of graphs of size linear in k which are identified by C3 but for which
the orbit partition is strictly finer than the Ck-partition. We also provide
identified graphs which have vertex-colored versions that are not identified by
Ck.Comment: 33 pages, 8 Figure
Local colourings and monochromatic partitions in complete bipartite graphs
We show that for any -local colouring of the edges of the balanced
complete bipartite graph , its vertices can be covered with at
most~ disjoint monochromatic paths. And, we can cover almost all vertices of
any complete or balanced complete bipartite -locally coloured graph with
disjoint monochromatic cycles.\\ We also determine the -local
bipartite Ramsey number of a path almost exactly: Every -local colouring of
the edges of contains a monochromatic path on vertices.Comment: 18 page
- âŚ