default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHunter S. Snevily
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j19]Timothy M. Brauch, André E. Kézdy, Hunter S. Snevily:
The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs. Ars Comb. 114: 461-475 (2014)- [j18]Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily:
On the van der Waerden numbers w(2; 3, t). Discret. Appl. Math. 174: 27-51 (2014) - 2013
- [j17]Tanbir Ahmed, Janusz Dybizbanski, Hunter S. Snevily:
Unique Sequences Containing No k-Term Arithmetic Progressions. Electron. J. Comb. 20(4): 29 (2013) - [j16]Tanbir Ahmed, Hunter S. Snevily:
Sparse Distance Sets in the Triangular Lattice. Electron. J. Comb. 20(4): 33 (2013) - [j15]Tanbir Ahmed, Michael G. Eldredge, Jonathan J. Marler, Hunter S. Snevily:
Strict Schur Numbers. Integers 13: A22 (2013) - 2011
- [i1]Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily:
On the van der Waerden numbers w(2;3,t). CoRR abs/1102.5433 (2011)
2000 – 2009
- 2009
- [j14]André E. Kézdy
, Hunter S. Snevily, Susan C. White:
Generalized Schur Numbers for x1 + x2 + c = 3x3. Electron. J. Comb. 16(1) (2009) - 2004
- [j13]André E. Kézdy, Hunter S. Snevily:
Polynomials that Vanish on Distinct nth Roots of Unity. Comb. Probab. Comput. 13(1): 37-59 (2004) - 2003
- [j12]Hunter S. Snevily:
A Sharp Bound for the Number of Sets that Pairwise Intersect at k Positive Values. Comb. 23(3): 527-533 (2003) - 2002
- [j11]André E. Kézdy, Hunter S. Snevily:
Distinct Sums Modulo N And Tree Embeddings. Comb. Probab. Comput. 11(1): 35-42 (2002) - 2000
- [j10]Hunter S. Snevily, James A. Foster:
The 2-Pebbling Property and a Conjecture of Graham's. Graphs Comb. 16(2): 231-244 (2000)
1990 – 1999
- 1999
- [j9]Hunter S. Snevily:
A Generalization of Fisher's Inequality. J. Comb. Theory A 85(1): 120-125 (1999) - 1997
- [j8]Hunter S. Snevily:
New families of graphs that have alpha-labelings. Discret. Math. 170(1-3): 185-194 (1997) - [j7]André E. Kézdy, Hunter S. Snevily:
On Extensions of a Conjecture of Gallai. J. Comb. Theory B 70(2): 317-324 (1997) - 1996
- [j6]André E. Kézdy, Hunter S. Snevily, Chi Wang:
Partitioning Permutations into Increasing and Decreasing Subsequences. J. Comb. Theory A 73(2): 353-359 (1996) - [j5]Lisa R. Markus, Hunter S. Snevily:
Disjoint cycles in star-free graphs. J. Graph Theory 21(4): 425-430 (1996) - 1994
- [j4]Hunter S. Snevily:
The snake-in-the-box problem: A new upper bound. Discret. Math. 133(1-3): 307-314 (1994) - [j3]D. A. Duffus, Hal A. Kierstead, Hunter S. Snevily:
An Explicit 1-Factorization in the Middle of the Boolean Lattice. J. Comb. Theory A 65(2): 334-342 (1994) - [j2]Hunter S. Snevily:
On Generalizations of the deBruijn - Erdös Theorem. J. Comb. Theory A 68(1): 232-238 (1994) - 1992
- [j1]Hunter S. Snevily:
A New Result on Chvátal's Conjecture. J. Comb. Theory A 61(1): 137-141 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
