Péter Komjáth

According to our database1, Péter Komjáth authored at least 52 papers between 1984 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Minimal covering sets for infinite set systems.
Discrete Mathematics, 2019

2018
A Ramsey theorem for metric spaces.
Discrete Mathematics, 2018

Note A Ramsey Statement for Infinite Groups.
Combinatorica, 2018

2017
Well Ordering Groups with no Monotone Arithmetic Progressions.
Order, 2017

2016
A problem of Laczkovich: How dense are set systems with no large independent sets?
Ann. Pure Appl. Logic, 2016

A remark on hereditarily nonparadoxical sets.
Arch. Math. Log., 2016

2015
A note on uncountable chordal graphs.
Discrete Mathematics, 2015

2013
Note on the point character of l 1-spaces.
Periodica Mathematica Hungarica, 2013

Set Theory: Geometric and Real.
Proceedings of the Mathematics of Paul Erdős II, 2013

2011
The quasi order of graphs on an ordinal.
Discrete Mathematics, 2011

The chromatic number of infinite graphs - A survey.
Discrete Mathematics, 2011

The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces.
Discrete & Computational Geometry, 2011

2008
Ultrafilters.
The American Mathematical Monthly, 2008

Colorful Flowers.
Electronic Notes in Discrete Mathematics, 2008

2005
The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah.
J. Mathematical Logic, 2005

Finite subgraphs of uncountably chromatic graphs.
Journal of Graph Theory, 2005

2004
Wild edge colourings of graphs.
J. Symb. Log., 2004

2003
A Partition Theorem for Scattered Order Types.
Combinatorics, Probability & Computing, 2003

Some Remarks on the Simultaneous Chromatic Number.
Combinatorica, 2003

2002
The Two Points Theorem of Mazurkiewicz.
J. Comb. Theory, Ser. A, 2002

2001
Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems.
Combinatorica, 2001

Three clouds may cover the plane.
Ann. Pure Appl. Logic, 2001

2000
Two Consistency Results on Set Mappings.
J. Symb. Log., 2000

1999
Some Remarks on the Partition Calculus of Ordinals.
J. Symb. Log., 1999

Some remarks on universal graphs.
Discrete Mathematics, 1999

Subgraph chromatic number.
Proceedings of the Set Theory: The Hajnal Conference, 1999

1997
On the existence of countable universal graphs.
Journal of Graph Theory, 1997

Two Remarks on the Coloring Number.
J. Comb. Theory, Ser. B, 1997

A Strongly Non-Ramsey Order Type.
Combinatorica, 1997

Nonexistence of Universal Graphs Without Some Trees.
Combinatorica, 1997

1995
Universal Graphs without Large Cliques.
J. Comb. Theory, Ser. B, 1995

1994
There is no universal countable pentagon-free graph.
Journal of Graph Theory, 1994

On a Conjecture of Rödl and Voigt.
J. Comb. Theory, Ser. B, 1994

The Complexity of a Class of Infinite Graphs.
Combinatorica, 1994

1992
Martin's axiom and spanning trees of infinite graphs.
J. Comb. Theory, Ser. B, 1992

1991
A Set Mapping with No Infinite Free Subsets.
J. Symb. Log., 1991

Universal elements and the complexity of certain classes of infinite graphs.
Discrete Mathematics, 1991

1990
Countable Decompositions of R2 and R3.
Discrete & Computational Geometry, 1990

1989
Set Systems with Finite Chromatic Number.
Eur. J. Comb., 1989

1988
Forcing Constructions for Uncountably Chromatic Graphs.
J. Symb. Log., 1988

A compactness theorem for perfect matchings in matroids.
J. Comb. Theory, Ser. B, 1988

A simplified construction of nonlinear Davenport-Schinzel sequences.
J. Comb. Theory, Ser. A, 1988

1987
Morasses and the Levy-Collapse.
J. Symb. Log., 1987

Ramsey-type results for metric spaces.
J. Comb. Theory, Ser. A, 1987

On k-transversals.
J. Comb. Theory, Ser. A, 1987

Some higher-gap examples in combinatorial set theory.
Ann. Pure Appl. Logic, 1987

1986
Stationary Reflection for Uncountable Cofinality.
J. Symb. Log., 1986

An infinite version of Ryser's inequality.
J. Comb. Theory, Ser. A, 1986

Coloring of universal graphs.
Graphs and Combinatorics, 1986

Coloring graphs with locally few colors.
Discrete Mathematics, 1986

1985
Orientation problems on sequences by recursive functions.
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?.
Combinatorica, 1984


  Loading...