default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarvey L. Abbott
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j39]H. L. Abbott, Donovan R. Hare
:
The set of values of b for which there exist block designs with b blocks. Discret. Math. 290(2/3): 275-282 (2005)- 2001
- [j38]H. L. Abbott, Donovan R. Hare:
Families of 4-Sets Without Property B. Ars Comb. 60 (2001) - 2000
- [j37]H. L. Abbott, Meir Katchalski:
Covering Squares with Squares. Discret. Comput. Geom. 24(2-3): 151-170 (2000)
1990 – 1999
- 1999
- [j36]H. L. Abbott, Donovan R. Hare:
Square critically 3-chromatic hypergraphs. Discret. Math. 197-198: 3-13 (1999) - 1998
- [j35]H. L. Abbott, Donovan R. Hare, Bing Zhou:
Color-critical graphs and hypergraphs with few edges and no short cycles. Discret. Math. 182(1-3): 3-11 (1998) - 1995
- [j34]H. L. Abbott, Donovan R. Hare, Bing Zhou:
Large Faces in 4-Critical Planar Graphs with Minimum Degree 4. Comb. 15(4): 455-467 (1995) - [j33]H. L. Abbott, Bing Zhou:
Some Remarks on (k-1)-Critical Subgraphs of k-Critical Graphs. Comb. 15(4): 469-474 (1995) - [j32]H. L. Abbott, M. J. Smuga-Otto:
Lower Bounds for Hypergraph Ramsey Numbers. Discret. Appl. Math. 61(2): 177-180 (1995) - 1994
- [j31]H. L. Abbott, Meir Katchalski, Bing Zhou:
Proof of a conjecture of Dirac concerning 4-critical planar graphs. Discret. Math. 132(1-3): 367-371 (1994) - [j30]H. L. Abbott, Bing Zhou, Donovan R. Hare:
Sparse color-critical graphs and hypergraphs with no short cycles. J. Graph Theory 18(4): 373-388 (1994) - 1993
- [j29]H. L. Abbott, Bing Zhou:
The star chromatic number of a graph. J. Graph Theory 17(3): 349-360 (1993) - 1992
- [j28]H. L. Abbott, Bing Zhou:
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs. Discret. Math. 100(1-3): 223-228 (1992) - [j27]H. L. Abbott, Geoffrey Exoo:
On set systems not containing delta systems. Graphs Comb. 8(1): 1-9 (1992) - [j26]H. L. Abbott:
Approximation for the Location of the Center of a Disk (M. L. Glasser and J. Koplowitz). SIAM Rev. 34(4): 658-661 (1992) - 1991
- [j25]H. L. Abbott, Bing Zhou:
The edge density of 4-critical planar graphs. Comb. 11(3): 185-189 (1991) - [j24]H. L. Abbott, Meir Katchalski:
Further results on snakes in powers of complete graphs. Discret. Math. 91(2): 111-120 (1991) - 1990
- [j23]Robert E. Terrell, H. L. Abbott:
The Complexity of the Standard Form of an Integer (K. V. Lever). SIAM Rev. 32(4): 674-681 (1990)
1980 – 1989
- 1989
- [j22]H. L. Abbott, Donovan R. Hare:
Sparse color-critical hypergraphs. Comb. 9(3): 233-243 (1989) - 1988
- [j21]H. L. Abbott, Meir Katchalski:
Snakes and pseudo-snakes in powers of complete graphs. Discret. Math. 68(1): 1-8 (1988) - [j20]H. L. Abbott, Meir Katchalski:
On the snake in the box problem. J. Comb. Theory B 45(1): 13-24 (1988) - 1987
- [j19]H. L. Abbott, A. Liu:
On a problem of P. Erdös concerning Property K. Comb. 7(3): 215-219 (1987) - 1982
- [j18]H. L. Abbott, A. Liu:
Remarks on a paper of Hirschfeld concerning Ramsey numbers. Discret. Math. 39(3): 327-328 (1982) - [j17]H. L. Abbott, Meir Katchalski:
On a Set of Lattice Points not Containing the Vertices of a Square. Eur. J. Comb. 3(3): 191-193 (1982) - 1981
- [j16]H. L. Abbott, A. C. Liu:
On property B(s), II. Discret. Math. 37(2-3): 135-141 (1981) - 1980
- [j15]H. L. Abbott, A. Liu, Bjarne Toft:
The enumeration problem for color critical linear hypergraphs. J. Comb. Theory B 29(1): 106-115 (1980) - [j14]H. L. Abbott:
On a Conjecture of Erdös and Silverman in Combinatorial Geometry. J. Comb. Theory A 29(3): 380-381 (1980)
1970 – 1979
- 1979
- [j13]Harvey L. Abbott, Meir Katchalski:
A Turán type problem for interval graphs. Discret. Math. 25(1): 85-88 (1979) - [j12]H. L. Abbott, A. C. Liu:
Bounds for the covering number of a graph. Discret. Math. 25(3): 281-284 (1979) - 1978
- [j11]H. L. Abbott, A. Liu:
A Covering Theorem for Quasi-groups. J. Comb. Theory A 25(1): 72-75 (1978) - 1977
- [j10]H. L. Abbott, Denis Hanson:
On finite Δ-systems II. Discret. Math. 17(2): 121-126 (1977) - 1975
- [j9]Harvey L. Abbott, Denis Hanson:
On a combinatorial problem in geometry. Discret. Math. 12(4): 389-392 (1975) - [j8]Harvey L. Abbott, A. C. Liu:
Ramsey numbers for triples. Discret. Math. 13(4): 299-305 (1975) - 1974
- [j7]H. L. Abbott, D. Hanson:
On finite Δ-systems. Discret. Math. 8(1): 1-12 (1974) - [j6]H. L. Abbott:
Some results in combinatorial geometry. Discret. Math. 9(3): 199-204 (1974) - [j5]H. L. Abbott, E. R. Williams:
Lower Bounds for Some Ramsey Numbers. J. Comb. Theory A 16(1): 12-17 (1974) - 1972
- [j4]H. L. Abbott:
Lower bounds for some Ramsey numbers. Discret. Math. 2(4): 289-293 (1972) - [j3]H. L. Abbott, Denis Hanson:
Lower Bounds for Certain Types of van der Waerden Numbers. J. Comb. Theory A 12(1): 143-146 (1972) - [j2]H. L. Abbott, Denis Hanson, Norbert Sauer:
Intersection Theorems for Systems of Sets. J. Comb. Theory A 12(3): 381-389 (1972) - [j1]H. L. Abbott, A. Liu:
On Partitioning Integers into Progression Free Sets. J. Comb. Theory A 13(3): 432-436 (1972)
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 2024-06-10 20:29 CEST 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:
