default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Hajnal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[p1]András Hajnal:
Paul Erdős' Set Theory. The Mathematics of Paul Erdős II 2013: 379-418
2000 – 2009
- 2007
- [j23]András Hajnal:
In memory of László Kalmár. Acta Cybern. 18(1): 7-8 (2007) - 2003
- [j22]András Hajnal, Péter Komjáth:
Some Remarks on the Simultaneous Chromatic Number. Comb. 23(1): 89-104 (2003) - 2001
- [j21]James E. Baumgartner, András Hajnal:
Polarized Partition Relations. J. Symb. Log. 66(2): 811-821 (2001)
1990 – 1999
- 1997
- [j20]András Hajnal, Péter Komjáth:
A Strongly Non-Ramsey Order Type. Comb. 17(3): 363-367 (1997) - 1996
- [j19]András Hajnal, Gyula O. H. Katona, Attila Sali:
Preface. Discret. Math. 150(1-3): 1 (1996) - 1994
- [j18]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers. Comb. Probab. Comput. 3: 297-325 (1994) - 1993
- [j17]Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures. Comb. 13(1): 31-56 (1993) - [j16]András Hajnal, Norbert Sauer:
Cut-sets in infinite graphs and partial orders. Discret. Math. 117(1-3): 113-125 (1993) - [j15]András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán:
Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci. 46(2): 129-154 (1993) - 1992
- [j14]János Gerlits, András Hajnal, Zoltán Szentmiklóssy:
On the cardinality of certain Hausdorff spaces. Discret. Math. 108(1-3): 31-35 (1992) - 1991
- [j13]Noga Alon, András Hajnal:
Ramsey graphs contain many distinct induced subgraphs. Graphs Comb. 7(1): 1-6 (1991) - [j12]Paul Erdös, András Hajnal, Zsolt Tuza:
Local constraints ensuring small representing sets. J. Comb. Theory A 58(1): 78-84 (1991)
1980 – 1989
- 1989
- [j11]Paul Erdös, András Hajnal:
Ramsey-type theorems. Discret. Appl. Math. 25(1-2): 37-52 (1989) - [j10]Paul Erdös, András Hajnal:
On the number of distinct induced subgraphs of a graph. Discret. Math. 75(1-3): 145-154 (1989) - 1988
- [c2]András Hajnal, Wolfgang Maass, György Turán:
On the Communication Complexity of Graph Properties. STOC 1988: 186-191 - 1987
- [j9]András Hajnal, Péter Komjáth:
Some higher-gap examples in combinatorial set theory. Ann. Pure Appl. Log. 33: 283-296 (1987) - [c1]András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán:
Threshold circuits of bounded depth. FOCS 1987: 99-110 - 1986
- [j8]Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress:
Coloring graphs with locally few colors. Discret. Math. 59(1-2): 21-34 (1986) - [j7]András Hajnal, Norbert Sauer:
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. Discret. Math. 59(1-2): 61-67 (1986) - 1985
- [j6]András Hajnal:
The chromatic number of the product of two Alef i - Chromatic Graphs can be countable. Comb. 5(2): 137-139 (1985) - [j5]Paul Erdös, András Hajnal:
Chromatic number of finite and infinite graphs and hypergraphs. Discret. Math. 53: 281-285 (1985) - 1984
- [j4]András Hajnal, Péter Komjáth:
What must and what need not be contained in a graph of uncountable chromatic number?. Comb. 4(1): 47-52 (1984) - 1983
- [j3]Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi:
More results on Ramsey - Turán Type problems. Comb. 3(1): 69-81 (1983) - [j2]András Hajnal, Vera T. Sós:
Paul Erdös is seventy. J. Graph Theory 7(4): 391-393 (1983)
1970 – 1979
- 1973
- [j1]András Hajnal, Bruce Rothschild:
A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems. J. Comb. Theory A 15(3): 359-362 (1973)
Coauthor Index
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:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
