In this article current directions in solving Lovász’s problem about the existence of Hamilton cycles and paths in connected vertex-transitive graphs are given. © 2009 Elsevier B.V. All rights reserved. 1. Historical motivation In 1969, Lovász [59] asked whether every finite connected vertex-transitive graph has a Hamilton path, that is, a simple path going through all vertices, thus tying toge...

Let $G$ be a transitive permutation group on finite set $\Omega$ and recall that base for is subset of with trivial pointwise stabiliser. The size $G$, denoted $b(G)$, the minimal base. If $b(G)=2$ then we can study Saxl graph $\Sigma(G)$ which has vertex two vertices are adjacent if they form This vertex-transitive graph, conjectured to connected diameter at most $2$ when primitive. In this pa...

We prove that every sufficiently large dense connected vertex-transitive graph is Hamiltonian.

A Cayley (resp. bi-Cayley) graph on a dihedral group is called dihedrant bi-dihedrant). In 2000, classification of trivalent arc-transitive dihedrants was given by Marušič and Pisanski, several years later, non-arc-transitive order 4p or 8p (p prime) were classified Feng et al. As generalization these results, our first result presents dihedrants. Using this, complete vertex-transitive non-Cayl...

An automorphism of a graph is called quasi-semiregular if it fixes unique vertex the and its remaining cycles have same length. This kind symmetry graphs was first investigated by Kutnar, Malnič, Martínez Marušič in 2013, as generalization well-known problem regarding existence semiregular automorphisms vertex-transitive graphs. Symmetric valency three or four, admitting automorphism, been clas...

A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p, under the assumption that G is a polytree and p satisfies weak transitivity. We prove that the criterion is sound and complete. We argue that assuming weak transitivity is not too restrictive.

We introduce two variations of the cops and robber game on graphs. These games yield invariants in Z+∪{∞} for any connected graph Γ, weak cop number wCop(Γ) strong sCop(Γ). satisfy that sCop(Γ)≤wCop(Γ). Any is finite or a tree has one. new are preserved under small local perturbations graph, specifically, both numbers quasi-isometric More generally, we prove if Δ quasi-retract Γ then wCop(Δ)≤wC...