For n ≥ 2, the concept of n-way expanders was defined by many researchers. Bigger n gives a weaker notion in general, and 2-way expanders coincide with expanders in usual sense. Koji Fujiwara asked whether these concepts are equivalent to that of ordi-nary expanders for all n for a sequence of Cayley graphs. In this paper, we answer his question in the affirmative. Furthermore, we obtain universal inequalities on multi-way isoperimetric constants on any finite connected vertex-transitive graph, and show that gaps between these constants imply the imprimitivity of the group action on the graph.
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
The C∗-algebra C∗(E) of a directed graph E is generated by partial isometries satisfying relations w...
A graph property is a class of graphs which is closed under isomorphisms. Some properties are also c...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
In this thesis we introduce a notion of graphs approximating actions of finitely generated groups on...
Expander graphs are an important tool in theoretical computer science, geometric group theory, proba...
We study the existence of expander graphs with a focus on odd and unique expanders. The main goal is...
Simple graphs having the property that every limited size subset of vertices has many outside neighb...
Expander graphs have been studied in various definitions and approaches. We show some relationships ...
© 2020 The Authors. The publishing rights in this article are licensed to the London Mathematical So...
Now that we have seen a variety of basic derandomization techniques, we will move on to study the fi...
The idea of applying isoperimetric functions to group theory is due to M. Gromov [8]. We introduce t...
AbstractLetCbe a conjugacy class in the alternating groupAn, and let supp(C) be the number of nonfix...
Like Cayley graphs, G-graphs are graphs that are constructed from groups. A method for constructing ...
The central goal of this thesis is to better understand, and explicitly construct, expanding towers ...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
The C∗-algebra C∗(E) of a directed graph E is generated by partial isometries satisfying relations w...
A graph property is a class of graphs which is closed under isomorphisms. Some properties are also c...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
In this thesis we introduce a notion of graphs approximating actions of finitely generated groups on...
Expander graphs are an important tool in theoretical computer science, geometric group theory, proba...
We study the existence of expander graphs with a focus on odd and unique expanders. The main goal is...
Simple graphs having the property that every limited size subset of vertices has many outside neighb...
Expander graphs have been studied in various definitions and approaches. We show some relationships ...
© 2020 The Authors. The publishing rights in this article are licensed to the London Mathematical So...
Now that we have seen a variety of basic derandomization techniques, we will move on to study the fi...
The idea of applying isoperimetric functions to group theory is due to M. Gromov [8]. We introduce t...
AbstractLetCbe a conjugacy class in the alternating groupAn, and let supp(C) be the number of nonfix...
Like Cayley graphs, G-graphs are graphs that are constructed from groups. A method for constructing ...
The central goal of this thesis is to better understand, and explicitly construct, expanding towers ...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
The C∗-algebra C∗(E) of a directed graph E is generated by partial isometries satisfying relations w...
A graph property is a class of graphs which is closed under isomorphisms. Some properties are also c...