The following pages link to Seress, Ákos (Q162994):
Displaying 50 items.
- (Q237008) (redirect page) (← links)
- Bounds on the diameter of Cayley graphs of the symmetric group (Q402925) (← links)
- Local 2-geodesic transitivity of graphs (Q404472) (← links)
- Majorana representations of \(A_5\). (Q455659) (← links)
- Generation of finite classical groups by pairs of elements with large fixed point spaces. (Q468691) (← links)
- \(s\)-arc-transitive graphs and normal subgroups (Q468707) (← links)
- Random generators of the symmetric group: diameter, mixing time and spectral gap. (Q468709) (← links)
- (Q592461) (redirect page) (← links)
- Majorana representations of the symmetric group of degree 4. (Q618256) (← links)
- Connected, bounded degree, triangle avoidance games (Q640454) (← links)
- Distinguishing labeling of the actions of almost simple groups. (Q663093) (← links)
- Extremely primitive classical groups. (Q714111) (← links)
- Large element orders and the characteristic of Lie-type simple groups. (Q731247) (← links)
- Symmetrical path-cycle covers of a graph and polygonal graphs (Q857413) (← links)
- On limit graphs of finite vertex-primitive graphs (Q857419) (← links)
- Some characterizations of type-1 \(\lambda\)-designs (Q910407) (← links)
- Decidability in elementary analysis. II (Q912081) (← links)
- (Q955025) (redirect page) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- The vertex primitive and vertex bi-primitive \(s\)-arc regular graphs (Q974464) (← links)
- (Q1053682) (redirect page) (← links)
- Gossiping old ladies (Q1053683) (← links)
- Coloring graphs with locally few colors (Q1074595) (← links)
- Quick gossiping without duplicate transmissions (Q1080864) (← links)
- The addition game: An abstraction of a communication problem (Q1097184) (← links)
- On the diameter of Cayley graphs of the symmetric group (Q1105690) (← links)
- On Hajnal's triangle-free game (Q1187952) (← links)
- Characterization of complete exterior sets of conics (Q1196683) (← links)
- On the diameter of permutation groups (Q1197618) (← links)
- Greedy construction of nearly regular graphs (Q1260772) (← links)
- The cocycle lattice of binary matroids (Q1260774) (← links)
- Nearly linear time algorithms for permutation groups: An interplay between theory and practice (Q1270640) (← links)
- On Erdős's Eulerian trail game (Q1300001) (← links)
- Prime power graphs for groups of Lie type (Q1348673) (← links)
- Bases for primitive permutation groups and a conjecture of Babai (Q1378433) (← links)
- On vertex-transitive, non-Cayley graphs of order \(pqr\) (Q1379986) (← links)
- Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets (Q1586333) (← links)
- Strong involutions in finite special linear groups of odd characteristic (Q1694594) (← links)
- Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order. (Q1766111) (← links)
- On the degree of transitivity of permutation groups: A short proof (Q1821193) (← links)
- Decidability in elementary analysis. I (Q1823233) (← links)
- All lambda-designs with \(\lambda = 2 p\) are type-1 (Q1841522) (← links)
- The number of directions determined by points in the three-dimensional Euclidean space (Q1864111) (← links)
- On Dowling geometries of infinite groups (Q1881688) (← links)
- Fast Monte Carlo algorithms for permutation groups (Q1892223) (← links)
- Dense graphs with cycle neighborhoods (Q1892847) (← links)
- Graphs of prescribed girth and bi-degree (Q1898720) (← links)
- The cocycle lattice of binary matroids. II (Q1899432) (← links)
- A family of near-polygonal graphs of valency 10 (Q1929742) (← links)
- A family of half-transitive graphs (Q1953443) (← links)
