Sciweavers

76 search results - page 14 / 16
» jct 2008
Sort
View
JCT
2010
63views more  JCT 2010»
13 years 4 months ago
Cyclic sieving, promotion, and representation theory
We prove a collection of conjectures of D. White [37], as well as some related conjectures of Abuzzahab-Korson-Li-Meyer [1] and of Reiner and White [21], [37], regarding the cyclic...
Brendon Rhoades
JCT
2008
70views more  JCT 2008»
13 years 5 months ago
Connectivity keeping edges in graphs with large minimum degree
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
Shinya Fujita, Ken-ichi Kawarabayashi
JCT
2008
103views more  JCT 2008»
13 years 5 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
JCT
2008
65views more  JCT 2008»
13 years 5 months ago
Random graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Colin McDiarmid
JCT
2008
67views more  JCT 2008»
13 years 5 months ago
On the number of directions determined by a pair of functions over a prime field
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...
Simeon Ball, András Gács, Pét...