![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jean A. Larson
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
- [j15]Jean A. Larson:
In memoriam: James Earl Baumgartner (1943-2011). Arch. Math. Log. 56(7-8): 877-909 (2017) - 2012
- [j14]Kenneth Kunen, Jean A. Larson, Juris Steprans
:
Continuous Maps on Aronszajn Trees. Order 29(2): 311-316 (2012) - 2011
- [j13]Péter Komjáth, Jean A. Larson, Norbert Sauer:
The quasi order of graphs on an ordinal. Discret. Math. 311(15): 1451-1460 (2011) - 2009
- [j12]Mirna Dzamonja
, Jean A. Larson, William J. Mitchell:
Partitions of large Rado graphs. Arch. Math. Log. 48(6): 579-606 (2009) - 2008
- [j11]Jean A. Larson:
Counting canonical partitions in the random graph. Comb. 28(6): 659-678 (2008) - 2006
- [j10]Jean A. Larson:
Partition relations on a plain product order type. Ann. Pure Appl. Log. 144(1-3): 117-125 (2006) - 2005
- [j9]Jean A. Larson:
Ramsey Theory for Countable Binary Homogeneous Structures. Notre Dame J. Formal Log. 46(3): 335-352 (2005) - 2000
- [j8]Jean A. Larson:
An Ordinal Partition Avoiding Pentagrams. J. Symb. Log. 65(3): 969-978 (2000) - 1992
- [j7]David A. Drake, Jean A. Larson:
The Nonexistence of Certain Projective Planes of Order 15. Exp. Math. 1(1): 65-69 (1992) - 1991
- [j6]Paul Erdös, Jean A. Larson:
Matchings from a set below to a set above. Discret. Math. 95(1-3): 169-182 (1991) - 1990
- [j5]James E. Baumgartner, Jean A. Larson:
A Diamond Example of an Ordinal Graph with No Infinite Paths. Ann. Pure Appl. Log. 47(1): 1-10 (1990) - [j4]Jean A. Larson:
Martin's Axiom and Ordinal Graphs: Large Independent Sets or Infinite Paths. Ann. Pure Appl. Log. 47(1): 31-39 (1990) - 1985
- [j3]Jean A. Larson:
The Number of One-Generated Cylindric Set Algebras of Dimension Greater than Two. J. Symb. Log. 50(1): 59-71 (1985) - 1983
- [j2]David A. Drake, Jean A. Larson:
Pairwise Balanced Designs Whose Line Sizes Do Not Divide Six. J. Comb. Theory A 34(3): 266-300 (1983) - 1979
- [j1]Jean A. Larson:
Some graphs with chromatic number three. J. Comb. Theory B 26(3): 317-322 (1979)
Conference and Workshop Papers
- 1999
- [c1]Carl Darby, Jean A. Larson:
Multicolored graphs on countable ordinals of finite exponent. Set Theory: The Hajnal Conference 1999: 31-43
Reference Works
- 2012
- [r1]Jean A. Larson:
Infinite Combinatorics. Sets and Extensions in the Twentieth Century 2012: 145-357
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint