Larson, Jean A.

• 2525447
  Džamonja, M.(4-EANG); Larson, J. A.(1-FL); Mitchell, W. J.(1-FL)
  Partitions of large Rado graphs. (English summary)
  Arch. Math. Logic 48 (2009), no. 6, 579--606.
  03E02 (05C75 05D10)
  
• 2520110
  Džamonja, M.(4-EANG); Larson, J. A.(1-FL); Mitchell, W. J.(1-FL)
  A partition theorem for a large dense linear order. (English summary)
  Israel J. Math. 171 (2009), 237--284.
  03E02 (03E35)
  
• 2488745
  Larson, Jean A.(1-FL)
  Counting canonical partitions in the random graph. (English summary)
  Combinatorica 28 (2008), no. 6, 659--678.
  05A15 (05C05 05C80)
  
• 2279658
  Larson, Jean A.(1-FL)
  Partition relations on a plain product order type. (English summary)
  Ann. Pure Appl. Logic 144 (2006), no. 1-3, 117--125.
  03E02 (03E50)
  
• 2162104
  Larson, Jean A.(1-FL)
  Ramsey theory for countable binary homogeneous structures. (English. English summary)
  Notre Dame J. Formal Logic 46 (2005), no. 3, 335--352 (electronic).
  03E02 (03C15 05C80 05D10)
• 1954737
  Larson, J. A.(1-FL)
  Erdös and ordinals. (English. English summary)
  Paul Erdös and his mathematics, II (Budapest, 1999), 427--451,
  Bolyai Soc. Math. Stud., 11,
  János Bolyai Math. Soc., Budapest, 2002.
  03E10 (03E02)
• 1903848
  Darby, Carl; Larson, Jean A.(1-FL)
  Multicolored graphs on countable ordinals of finite exponent. (English. English summary)
  Set theory (Piscataway, NJ, 1999), 31--43,
  DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 58,
  Amer. Math. Soc., Providence, RI, 2002.
  03E02 (05C15)
• 1791360
  Larson, Jean A.(1-FL)
  An ordinal partition avoiding pentagrams. (English. English summary)
  J. Symbolic Logic 65 (2000), no. 3, 969--978.
  03E02 (03E55)
• 1601992
  Larson, Jean A.(1-FL)
  A picaresque approach to set theory genealogy. (English. English summary)
  Set theory (Curaçao, 1995; Barcelona, 1996), 127--155,
  Kluwer Acad. Publ., Dordrecht, 1998.
  01A70 (01A55 01A60 01A80 03-03 04-03)
• 1601988
  Larson, Jean A.(1-FL)
  An ordinal partition from a scale. (English. English summary)
  Set theory (Curaçao, 1995; Barcelona, 1996), 109--125,
  Kluwer Acad. Publ., Dordrecht, 1998.
  03E05 (03E10)
• 1601956
  Set theory.
  Techniques and applications. Papers from the Joint US-Venezuela Conference on Combinatorial Set Theory and its Consequences held in Curaçao, June 26--30, 1995, and from the 2nd Conference on Techniques and Applications of Set Theory held in Barcelona, June 10--14, 1996. Edited by Carlos Augusto Di Prisco, Jean A. Larson, Joan Bagaria and A. R. D. Mathias.
  Kluwer Academic Publishers, Dordrecht, 1998. x+226 pp. ISBN 0-7923-4905-9
  03Exx (03-06)
• 1630775
  Larson, Jean A.(1-FL); Mitchell, William J.(1-FL)
  On a problem of Erdös and Rado. (English. English summary)
  Ann. Comb. 1 (1997), no. 3, 245--252.
  05C55 (05C20 06A07)
• 1261207
  Larson, Jean A.(1-FL)
  Some canonical partition ordinals. (English. English summary)
  Finite and infinite combinatorics in sets and logic (Banff, AB, 1991), 207--224,
  NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 411,
  Kluwer Acad. Publ., Dordrecht, 1993.
  03E05 (03E10 03E55)
• 1261198
  Erdös, Paul(H-AOS); Hajnal, A.(H-AOS); Larson, Jean A.(1-FL)
  Ordinal partition behavior of finite powers of cardinals. (English. English summary)
  Finite and infinite combinatorics in sets and logic (Banff, AB, 1991), 97--115,
  NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 411,
  Kluwer Acad. Publ., Dordrecht, 1993.
  03E05 (03E10 05D10)
• 1181088
  Drake, David A.(1-FL); Larson, Jean A.(1-FL)
  The nonexistence of certain projective planes of order $15$. (English. English summary)
  Experiment. Math. 1 (1992), no. 1, 65--69.
  51E15 (05B25 51E21)
• 1141937
  Erdös, Paul(H-AOS); Larson, Jean A.(1-FL)
  Matchings from a set below to a set above.
  Directions in infinite graph theory and combinatorics (Cambridge, 1989).
  Discrete Math. 95 (1991), no. 1-3, 169--182.
  04A20 (03E05 05C70)
• 1050560
  Larson, Jean A.(1-FL)
  Martin's axiom and ordinal graphs: large independent sets or infinite paths.
  Ann. Pure Appl. Logic 47 (1990), no. 1, 31--39.
  03E05 (03E35 03E50)
• 1050558
  Baumgartner, James E.(1-DTM); Larson, Jean A.(1-FL)
  A diamond example of an ordinal graph with no infinite paths.
  Ann. Pure Appl. Logic 47 (1990), no. 1, 1--10.
  03E05 (03E35 03E65)
• 896028
  Larson, Jean A.(1-FL)
  A GCH example of an ordinal graph with no infinite path.
  Trans. Amer. Math. Soc. 303 (1987), no. 1, 383--393.
  03E50 (03E05 04A20 05C99)
• 838630
  Larson, Jean A.(1-FL)
  A consequence of no short scale for ordinal graphs with no infinite paths.
  J. London Math. Soc. (2) 33 (1986), no. 2, 193--202.
  03E10 (03E05 04A10 04A20)
• 830697
  Dow, Stephen J.(1-ALH); Drake, David A.(1-FL); Füredi, Zoltán(H-AOS); Larson, Jean A.(1-FL)
  A lower bound for the cardinality of a maximal family of mutually intersecting sets of equal size.
  Proceedings of the sixteenth Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1985).
  Congr. Numer. 48 (1985), 47--48.
  05A05 (05C35)
• 780525
• 779156
• 760409
  Drake, David A.(1-FL); Larson, Jean A.(1-FL)
  A quest for certain linear spaces on thirty points.
  J. Statist. Plann. Inference 10 (1984), no. 2, 241--255.
  05B05 (05B30)
• 690827
  Larson, Jean A.
  The number of one-generated diagonal-free cylindric set algebras of finite dimension greater than two.
  Algebra Universalis 16 (1983), no. 1, 1--16.
  03G15
• 700035
  Drake, David A.(1-FL); Larson, Jean A.(1-FL)
  Pairwise balanced designs whose line sizes do not divide six.
  J. Combin. Theory Ser. A 34 (1983), no. 3, 266--300.
  05B05
• 772589
  Erdös, P.; Larson, J.(1-FL)
  On pairwise balanced block designs with the sizes of blocks as uniform as possible.
  Algebraic and geometric combinatorics, 129--134,
  North-Holland Math. Stud., 65,
  North-Holland, Amsterdam, 1982.
  05B05 (11B75)
• 608651
  Erdös, Paul; Faber, Vance; Larson, Jean
  Sets of natural numbers of positive density and cylindric set algebras of dimension $2$.
  Algebra Universalis 12 (1981), no. 1, 81--92.
  03G15 (06E99 10L10)
• 597456
  Larson, Jean A.
  A counterexample in the partition calculus for an uncountable ordinal.
  Israel J. Math. 36 (1980), no. 3-4, 287--299.
  04A20
• 596923
  Larson, Jean A.; Laver, Richard; McNulty, George F.
  Square-free and cube-free colorings of the ordinals.
  Pacific J. Math. 89 (1980), no. 1, 137--141.
  03E10 (04A10)
• 585555
  Larson, Jean A.
  Pinning for pairs of countable ordinals.
  Fund. Math. 108 (1980), no. 1, 7--21.
  04A20
• 536361
  Baumgartner, J.; Erdös, P.; Galvin, F.; Larson, J.
  Colorful partitions of cardinal numbers.
  Canad. J. Math. 31 (1979), no. 3, 524--541.
  04A20 (05C15)
• 535944
  Larson, Jean A.
  Some graphs with chromatic number three.
  J. Combin. Theory Ser. B 26 (1979), no. 3, 317--322.
  05C35 (05C15)
• 527726
  Larson, Jean A.
  An independence result for pinning for ordinals.
  J. London Math. Soc. (2) 19 (1979), no. 1, 1--6.
  03E10 (03E35 03E50)
• 485596
  Larson, Jean A.
  A solution for scattered order types of a problem of Hagendorf.
  Pacific J. Math. 74 (1978), no. 2, 373--379.
  06A05
• 376356
  Larson, J. A.
  Partition theorems for certain ordinal products.
  Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday), Vol. II, pp. 1017--1024. Colloq. Math. Soc. Janos Bolyai, Vol. 10,
  North-Holland, Amsterdam, 1975.
  04A20
• 360280
  Galvin, Fred; Larson, Jean
  Pinning countable ordinals.
  Collection of articles dedicated to Andrzej Mostowski on his sixtieth birthday, VIII.
  Fund. Math. 82 (1974/75), 357--361.
  04A10
• 337632
  Larson, Jean A.
  A short proof of a partition theorem for the ordinal $\omega \sp{\omega }$.
  Ann. Math. Logic 6 (1973/74), 129--145.
  04A20