Péter Komjáth

Discret. Comput. Geom., April, 2024

2021

Notes on some ERDőS-Hajnal Problems.

[BibT_eX]

[DOI]

J. Symb. Log., 2021

2020

Constructions of infinite graphs with Ramsey property.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

2019

Universal graphs omitting finitely many finite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

Minimal covering sets for infinite set systems.

[BibT_eX]

[DOI]

Discret. Math., 2019

The Colouring Number of Infinite Graphs.

[BibT_eX]

[DOI]

Comb., 2019

2018

A Ramsey theorem for metric spaces.

[BibT_eX]

[DOI]

Discret. Math., 2018

Note A Ramsey Statement for Infinite Groups.

[BibT_eX]

[DOI]

Comb., 2018

2017

Well Ordering Groups with no Monotone Arithmetic Progressions.

[BibT_eX]

[DOI]

Gyula Károlyi

Order, 2017

2016

A problem of Laczkovich: How dense are set systems with no large independent sets?

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

A remark on hereditarily nonparadoxical sets.

[BibT_eX]

[DOI]

Arch. Math. Log., 2016

2015

A note on uncountable chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

2013

Note on the point character of l 1-spaces.

[BibT_eX]

[DOI]

Christian Avart

Vojtech Rödl

Period. Math. Hung., 2013

Set Theory: Geometric and Real.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2011

The quasi order of graphs on an ordinal.

[BibT_eX]

[DOI]

Jean A. Larson

Norbert Sauer

Discret. Math., 2011

The chromatic number of infinite graphs - A survey.

[BibT_eX]

[DOI]

Discret. Math., 2011

The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

2008

Ultrafilters.

[BibT_eX]

[DOI]

Vilmos Totik

Am. Math. Mon., 2008

Colorful Flowers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2005

The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah.

[BibT_eX]

[DOI]

Matthew Foreman

J. Math. Log., 2005

Finite subgraphs of uncountably chromatic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

2004

Wild edge colourings of graphs.

[BibT_eX]

[DOI]

Mirna Dzamonja

Charles Morgan

J. Symb. Log., 2004

2003

A Partition Theorem for Scattered Order Types.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Some Remarks on the Simultaneous Chromatic Number.

[BibT_eX]

[DOI]

Comb., 2003

2002

The Two Points Theorem of Mazurkiewicz.

[BibT_eX]

[DOI]

James H. Schmerl

J. Comb. Theory, Ser. A, 2002

2001

Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems.

[BibT_eX]

[DOI]

Comb., 2001

Three clouds may cover the plane.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2001

2000

Two Consistency Results on Set Mappings.

[BibT_eX]

[DOI]

J. Symb. Log., 2000

1999

Some Remarks on the Partition Calculus of Ordinals.

[BibT_eX]

[DOI]

J. Symb. Log., 1999

Some remarks on universal graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Subgraph chromatic number.

[BibT_eX]

[DOI]

Proceedings of the Set Theory: The Hajnal Conference, 1999

1997

On the existence of countable universal graphs.

[BibT_eX]

[DOI]

Zoltán Füredi

J. Graph Theory, 1997

Two Remarks on the Coloring Number.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1997

A Strongly Non-Ramsey Order Type.

[BibT_eX]

[DOI]

Comb., 1997

Nonexistence of Universal Graphs Without Some Trees.

[BibT_eX]

[DOI]

Zoltán Füredi

Comb., 1997

1995

Universal Graphs without Large Cliques.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1995

1994

There is no universal countable pentagon-free graph.

[BibT_eX]

[DOI]

Gregory L. Cherlin

J. Graph Theory, 1994

On a Conjecture of Rödl and Voigt.

[BibT_eX]

[DOI]

E. C. Milner

J. Comb. Theory, Ser. B, 1994

The Complexity of a Class of Infinite Graphs.

[BibT_eX]

[DOI]

János Pach

Comb., 1994

1992

Martin's axiom and spanning trees of infinite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1992

1991

A Set Mapping with No Infinite Free Subsets.

[BibT_eX]

[DOI]

J. Symb. Log., 1991

Universal elements and the complexity of certain classes of infinite graphs.

[BibT_eX]

[DOI]

János Pach

Discret. Math., 1991

1990

Countable Decompositions of R2 and R3.

[BibT_eX]

[DOI]

Paul Erdös

Discret. Comput. Geom., 1990

1989

Set Systems with Finite Chromatic Number.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

1988

Forcing Constructions for Uncountably Chromatic Graphs.

[BibT_eX]

[DOI]

J. Symb. Log., 1988

A compactness theorem for perfect matchings in matroids.

[BibT_eX]

[DOI]

E. C. Milner

Norbert Polat

J. Comb. Theory, Ser. B, 1988

A simplified construction of nonlinear Davenport-Schinzel sequences.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1988

1987

Morasses and the Levy-Collapse.

[BibT_eX]

[DOI]

J. Symb. Log., 1987

Ramsey-type results for metric spaces.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1987

On k-transversals.

[BibT_eX]

[DOI]

Ron Aharoni

J. Comb. Theory, Ser. A, 1987

Some higher-gap examples in combinatorial set theory.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1987

1986

Stationary Reflection for Uncountable Cofinality.

[BibT_eX]

[DOI]

J. Symb. Log., 1986

An infinite version of Ryser's inequality.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1986

Coloring of universal graphs.

[BibT_eX]

[DOI]

Vojtech Rödl

Graphs Comb., 1986

Coloring graphs with locally few colors.

[BibT_eX]

[DOI]

Discret. Math., 1986

1985

Orientation problems on sequences by recursive functions.

[BibT_eX]

[DOI]

Zsolt Mihály Szabó

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984

What must and what need not be contained in a graph of uncountable chromatic number?.

[BibT_eX]

[DOI]