Related papers: Transitive graphs in counterexamples to Karp's con…
Many graph properties (e.g., connectedness, containing a complete subgraph) are known to be difficult to check. In a decision-tree model, the cost of an algorithm is measured by the number of edges in the graph that it queries. R. Karp…
The Evasiveness conjecture have been proved for properties of graphs on a prime-power number of vertices and the six vertices case. The ten vertices case is still unsolved. In this paper we study the size of the automorphism group of a…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…
We compare three transitivity properties of finite graphs, namely, for a positive integer $s$, $s$-distance transitivity, $s$-geodesic transitivity and $s$-arc transitivity. It is known that if a finite graph is $s$-arc transitive but not…
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form "is there an edge between vertices u and v" requires, in the worst case, to ask about all pairs of vertices. Most…
A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…
A graph property is said to be elusive ( evasive) if every algorithm testing this property by asking questions of the form "is there an edge between vertices x and y" requires, in the worst case, to ask about all pairs of vertices. The…
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…
We show that there exist functions $c$ and $g$ such that, if $k$, $n$ and $d$ are positive integers with $d> g(n)$ and $\Gamma$ is a $d$-valent $2$-arc-transitive graph of order $kp^n$ with $p$ a prime, then $p\leqslant kc(d)$. In other…
In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case of vertex-transitive graphs to a question raised by Berge and…
Consider simple random walk $(X_n)_{n\geq0}$ on a transitive graph with spectral radius $\rho$. Let $u_n=\mathbb{P}[X_n=X_0]$ be the $n$-step return probability and $f_n$ be the first return probability at time $n$. It is a folklore…
Alon and Yuster proved that the number of orientations of any $n$-vertex graph in which every $K_3$ is transitively oriented is at most $2^{\lfloor n^2/4\rfloor}$ for $n \geq 10^4$ and conjectured that the precise lower bound on $n$ should…
We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of…
Let $s$ be a positive integer. A graph is $s$-transitive if its automorphism group is transitive on s-arcs but not on $(s + 1)$-arcs. In this paper, we study all tetravalent s-transitive graphs of order $6p^2$.
The weak cop number of infinite graphs can be seen as a coarse-geometric analogue to the cop number of finite graphs. We show that every vertex transitive graph with at least one thick end has infinite weak cop number. It follows that every…
For $k\mid n$ let $Comb_{n,k}$ denote the tree consisting of an $(n/k)$-vertex path with disjoint $k$-vertex paths beginning at each of its vertices. An old conjecture says that for any $k=k(n)$ the threshold for the random graph $G(n,p)$…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…
A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…