Andras Hajnal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andras Hajnal has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
E. Szemerédi
2 shared publicationsM. Simonovits
2 shared publicationsP. Komjath
2 shared publicationsPaul Erdős
2 shared publications- Péter Komjáth
Eötvös University
2 shared publications V.T. Sós
2 shared publications
Latest Publications
- 1 January 2003
- Published by Springer Nature in Combinatorica
- Vol. 23 (1) , 89-104
Some Remarks on the Simultaneous Chromatic Number
- 1 January 2003
- Published by Springer Nature in Combinatorica
- Vol. 23 (1) , 89-104
Some Remarks on the Simultaneous Chromatic Number
- 1 June 2001
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 66 (2) , 811-821
Polarized partition relations
It is shown that for any cardinal κ, , and if κ is weakly compact then .
- 1 June 2001
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 66 (2) , 811-821
Polarized partition relations
It is shown that for any cardinal κ, , and if κ is weakly compact then .
- 1 April 1999
- Published by Springer Nature in Algebra universalis
- Vol. 41 (1) , 85-86
On isotone maps on a countable lattice
- 1 April 1999
- Published by Springer Nature in Algebra universalis
- Vol. 41 (1) , 85-86
On isotone maps on a countable lattice
- 1 December 1997
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 102 (1) , 283-295
On a metric generalization of ramsey’s theorem
- 1 December 1997
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 102 (1) , 283-295
On a metric generalization of ramsey’s theorem
- 1 September 1997
- Published by Springer Nature in Combinatorica
- Vol. 17 (3) , 363-367
A strongly non-Ramsey order type
- 1 September 1997
- Published by Springer Nature in Combinatorica
- Vol. 17 (3) , 363-367
A strongly non-Ramsey order type
- 22 May 1997
- Published by Cambridge University Press (CUP)
- p. 253-282
Turán–Ramsey Theorems and Kp-Independence Numbers
- 22 May 1997
- Published by Cambridge University Press (CUP)
- p. 253-282
Turán–Ramsey Theorems and Kp-Independence Numbers
- 22 May 1997
- Published by Cambridge University Press (CUP)
Combinatorics, Geometry and Probability
Paul Erdös was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdös himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.
- 22 May 1997
- Published by Cambridge University Press (CUP)
Combinatorics, Geometry and Probability
Paul Erdös was one of the greatest mathematicians of this century, known the world over for his brilliant ideas and stimulating questions. On the date of his 80th birthday a conference was held in his honour at Trinity College, Cambridge. Many leading combinatorialists attended. Their subsequent contributions are collected here. The areas represented range from set theory and geometry, through graph theory, group theory and combinatorial probability, to randomised algorithms and statistical physics. Erdös himself was able to give a survey of recent progress made on his favourite problems. Consequently this volume, consisting of in-depth studies at the frontier of research, provides a valuable panorama across the breadth of combinatorics as it is today.
- 1 July 1992
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 332 (1) , 475
Corrigendum to "Embedding Graphs into Colored Graphs"
- 1 July 1992
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 332 (1) , 475
Corrigendum to "Embedding Graphs into Colored Graphs"
- 1 May 1988
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 307 (1) , 395-409
Embedding Graphs into Colored Graphs
If $X$ is a graph, $\kappa$ a cardinal, then there is a graph $Y$ such that if the vertex set of $Y$ is $\kappa$-colored, then there exists a monocolored induced copy of $X$; moreover, if $X$ does not contain a complete graph on $\alpha$ vertices, neither does $Y$. This may not be true, if we exclude noncomplete graphs as subgraphs. It is consistent that there exists a graph $X$ such that for every graph $Y$ there is a two-coloring of the edges of $Y$ such that there is no monocolored induced copy of $X$. Similarly, a triangle-free $X$ may exist such that every $Y$ must contain an infinite complete graph, assuming that coloring $Y$’s edges with countably many colors a monocolored copy of $X$ always exists.- 1 May 1988
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 307 (1) , 395-409
Embedding Graphs into Colored Graphs
If $X$ is a graph, $\kappa$ a cardinal, then there is a graph $Y$ such that if the vertex set of $Y$ is $\kappa$-colored, then there exists a monocolored induced copy of $X$; moreover, if $X$ does not contain a complete graph on $\alpha$ vertices, neither does $Y$. This may not be true, if we exclude noncomplete graphs as subgraphs. It is consistent that there exists a graph $X$ such that for every graph $Y$ there is a two-coloring of the edges of $Y$ such that there is no monocolored induced copy of $X$. Similarly, a triangle-free $X$ may exist such that every $Y$ must contain an infinite complete graph, assuming that coloring $Y$’s edges with countably many colors a monocolored copy of $X$ always exists.