Bill Sands

According to our database1, Bill Sands authored at least 20 papers between 1980 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Chop vectors and the lattice of integer partitions.
Discret. Math., 2012

2011
Cards, permutations, and sums.
Contributions Discret. Math., 2011

2010
When Will Every Maximal <i>F</i>-free Subposet Contain a Maximal Element?
Order, 2010

Posets with the Maximal Antichain Property.
Order, 2010

On the size of maximal chains and the number of pairwise disjoint maximal antichains.
Discret. Math., 2010

2005
Splitting Numbers of Grids.
Electron. J. Comb., 2005

On the number of elements dominated by a subgroup.
Ars Comb., 2005

2000
Completely Disconnecting the Complete Graph.
SIAM J. Discret. Math., 2000

An optimal algorithm for a parallel cutting problem.
Ars Comb., 2000

1999
An inequality for the sizes of prime filters of finite distributive lattices.
Discret. Math., 1999

1996
A note on paths in edge-coloured tournaments.
Ars Comb., 1996

1993
A Maximum Volume.
SIAM Rev., 1993

1991
Two-colouring all two-element maximal antichains.
J. Comb. Theory A, 1991

1990
Maximal Chains and Antichains in Boolean Lattices.
SIAM J. Discret. Math., 1990

1989
A length-width inequality for partially ordered sets with two-element cutsets.
J. Comb. Theory B, 1989

1986
A size-width inequality for distributive lattices.
Comb., 1986

1985
On the chromatic number of the product of graphs.
J. Graph Theory, 1985

1982
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory B, 1982

1981
Counting antichains in finite partially ordered sets.
Discret. Math., 1981

1980
Generating sets for lattices of dimension two.
Discret. Math., 1980


  Loading...