Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Gabriel Verret"'
Publikováno v:
Journal of Graph Theory. 99:207-216
It is known that there are precisely three transitive permutation groups of degree $6$ that admit an invariant partition with three parts of size $2$ such that the kernel of the action on the parts has order $4$; these groups are called $A_4(6)$, $S_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a1ae8e297db02a5023bedb4d0040fc5
https://doi.org/10.1002/jgt.22735
https://doi.org/10.1002/jgt.22735
Publikováno v:
Discrete Applied Mathematics. 291:116-128
This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph–Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence 2 so that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ae20da53b56e0408142277e73f0d51c
https://doi.org/10.1016/j.dam.2020.10.028
https://doi.org/10.1016/j.dam.2020.10.028
Publikováno v:
Journal of Algebra. 569:318-333
A Cayley graph for a group G is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of G is an element of the normaliser of G. A group G is then said to be CCA if every connected Cayley graph on G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f962cdd62b3131ace3d1410d4e086d1d
https://doi.org/10.1016/j.jalgebra.2020.10.028
https://doi.org/10.1016/j.jalgebra.2020.10.028
Autor:
Florian Lehner, Gabriel Verret
Publikováno v:
Ars Mathematica Contemporanea. 19:77-82
Recently, Huang gave a very elegant proof of the Sensitivity Conjecture by proving that hypercube graphs have the following property: every induced subgraph on a set of more than half the vertices has maximum degree at least √d , where d is the val
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fecd12be7e01a422ea1c78e3862eb85f
https://doi.org/10.26493/1855-3974.2301.63f
https://doi.org/10.26493/1855-3974.2301.63f
Autor:
Gabriel Verret, Binzhou Xia
In this paper, we show that every finite simple group of order at least $5$ admits an oriented regular representation of out-valency $2$.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::417c76a6d970a09ca76eda6537183830
http://arxiv.org/abs/2102.07893
http://arxiv.org/abs/2102.07893
We say that a finite group G is "DRR-detecting" if, for every subset S of G, either the Cayley digraph Cay(G,S) is a digraphical regular representation (that is, its automorphism group acts regularly on its vertex set) or there is a nontrivial group
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d323583fb3bfcb16235c8546bf40800
http://arxiv.org/abs/2005.09798
http://arxiv.org/abs/2005.09798
Publikováno v:
Journal of the London Mathematical Society. 98:557-572
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds on the comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dccc3ee79e5971c15ca2ecfd483af431
https://doi.org/10.1112/jlms.12138
https://doi.org/10.1112/jlms.12138
Publikováno v:
Journal of Combinatorial Theory, Series B. 125:80-94
For an integer k ⩾ 1 , a graph is called a k-multicirculant if its automorphism group contains a cyclic semiregular subgroup with k orbits on the vertices. If k is even, there exist infinitely many cubic arc-transitive k -multicirculants. We conjec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a861ec99d9e5b1e616a02b96a9960a5
https://doi.org/10.1016/j.jctb.2017.03.001
https://doi.org/10.1016/j.jctb.2017.03.001
Publikováno v:
Journal of Combinatorial Theory, Series B. 122:221-240
Let $G$ be a group and let $S$ be an inverse-closed and identity-free generating set of $G$. The \emph{Cayley graph} $\Cay(G,S)$ has vertex-set $G$ and two vertices $u$ and $v$ are adjacent if and only if $uv^{-1}\in S$. Let $CAY_d(n)$ be the number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6eb098119622d3c688543bc6dee5783
https://doi.org/10.1016/j.jctb.2016.06.002
https://doi.org/10.1016/j.jctb.2016.06.002
Publikováno v:
Journal of Combinatorial Theory, Series B. 117:77-87
We show that there exist functions c and g such that, if k, n and d are positive integers with d g ( n ) and ? is a d-valent 2-arc-transitive graph of order k p n with p a prime, then p ≤ k c ( d ) . In other words, there are only finitely many d-v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::194ce397c8eab0f73ad9d6c587d0caea
https://doi.org/10.1016/j.jctb.2015.11.001
https://doi.org/10.1016/j.jctb.2015.11.001