Sciweavers

73
Voted
EJC
2000
15 years 7 days ago
Yet Another Triangle for the Genocchi Numbers
Richard Ehrenborg, Einar Steingrímsson
72
Voted
EJC
2000
15 years 7 days ago
A Note on Distance Approximating Trees in Graphs
Victor Chepoi, Feodor F. Dragan
EJC
2000
15 years 7 days ago
Cyclic Polytopes and Oriented Matroids
Consider the moment curve in the real Euclidean space Rd defined parametrically by the map : R Rd , t (t) = (t, t2 , . . . , td ). The cyclic d-polytope Cd(t1, . . . , tn) is t...
Raul Cordovil, Pierre Duchet
EJC
2000
15 years 7 days ago
On Intersection Sets in Desarguesian Affine Spaces
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
Simeon Ball
EJC
2000
15 years 7 days ago
Fiber Polytopes for the Projections between Cyclic Polytopes
Christos A. Athanasiadis, Jesús A. De Loera...
EJC
2000
15 years 7 days ago
Shortest Paths in Distance-regular Graphs
Enrique Bendito, Angeles Carmona, Andrés M....
EJC
2007
15 years 11 days ago
Random inscribing polytopes
Ross M. Richardson, Van H. Vu, Lei Wu
EJC
2007
15 years 11 days ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...