Hunter S. Snevily

According to our database1, Hunter S. Snevily authored at least 20 papers between 1992 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
On the van der Waerden numbers w(2; 3, t).
Discret. Appl. Math., 2014

The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.
Ars Comb., 2014

2013
Strict Schur Numbers.
Integers, 2013

Sparse Distance Sets in the Triangular Lattice.
Electron. J. Comb., 2013

Unique Sequences Containing No k-Term Arithmetic Progressions.
Electron. J. Comb., 2013

2011
On the van der Waerden numbers w(2;3,t)
CoRR, 2011

2009
Generalized Schur Numbers for x<sub>1</sub> + x<sub>2</sub> + c = 3x<sub>3</sub>.
Electron. J. Comb., 2009

2004
Polynomials that Vanish on Distinct nth Roots of Unity.
Comb. Probab. Comput., 2004

2003
A Sharp Bound for the Number of Sets that Pairwise Intersect at <i>k</i> Positive Values.
Comb., 2003

2002
Distinct Sums Modulo N And Tree Embeddings.
Comb. Probab. Comput., 2002

2000
The 2-Pebbling Property and a Conjecture of Graham's.
Graphs Comb., 2000

1999
A Generalization of Fisher's Inequality.
J. Comb. Theory, Ser. A, 1999

1997
On Extensions of a Conjecture of Gallai.
J. Comb. Theory, Ser. B, 1997

New families of graphs that have alpha-labelings.
Discret. Math., 1997

1996
Disjoint cycles in star-free graphs.
J. Graph Theory, 1996

Partitioning Permutations into Increasing and Decreasing Subsequences.
J. Comb. Theory, Ser. A, 1996

1994
On Generalizations of the deBruijn - Erdös Theorem.
J. Comb. Theory, Ser. A, 1994

An Explicit 1-Factorization in the Middle of the Boolean Lattice.
J. Comb. Theory, Ser. A, 1994

The snake-in-the-box problem: A new upper bound.
Discret. Math., 1994

1992
A New Result on Chvátal's Conjecture.
J. Comb. Theory, Ser. A, 1992


  Loading...