Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: András Hajnal
@incollection{DBLP:books/daglib/p/Hajnal13, author = {Andr{\'{a}}s Hajnal}, editor = {Ronald L. Graham and Jaroslav Nesetril and Steve Butler}, title = {Paul Erd{\H{o}}s' Set Theory}, booktitle = {The Mathematics of Paul Erd{\H{o}}s {II}}, pages = {379--418}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-1-4614-7254-4\_23}, doi = {10.1007/978-1-4614-7254-4\_23}, timestamp = {Fri, 02 Nov 2018 09:27:02 +0100}, biburl = {https://dblp.org/rec/books/daglib/p/Hajnal13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/actaC/Hajnal07, author = {Andr{\'{a}}s Hajnal}, title = {In memory of L{\'{a}}szl{\'{o}} Kalm{\'{a}}r}, journal = {Acta Cybern.}, volume = {18}, number = {1}, pages = {7--8}, year = {2007}, url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3701}, timestamp = {Wed, 16 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/actaC/Hajnal07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/HajnalK03, author = {Andr{\'{a}}s Hajnal and P{\'{e}}ter Komj{\'{a}}th}, title = {Some Remarks on the Simultaneous Chromatic Number}, journal = {Comb.}, volume = {23}, number = {1}, pages = {89--104}, year = {2003}, url = {https://doi.org/10.1007/s00493-003-0015-2}, doi = {10.1007/S00493-003-0015-2}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/combinatorica/HajnalK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsyml/BaumgartnerH01, author = {James E. Baumgartner and Andr{\'{a}}s Hajnal}, title = {Polarized Partition Relations}, journal = {J. Symb. Log.}, volume = {66}, number = {2}, pages = {811--821}, year = {2001}, url = {https://doi.org/10.2307/2695046}, doi = {10.2307/2695046}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsyml/BaumgartnerH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/HajnalK97, author = {Andr{\'{a}}s Hajnal and P{\'{e}}ter Komj{\'{a}}th}, title = {A Strongly Non-Ramsey Order Type}, journal = {Comb.}, volume = {17}, number = {3}, pages = {363--367}, year = {1997}, url = {https://doi.org/10.1007/BF01215918}, doi = {10.1007/BF01215918}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/HajnalK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HajnalKS96, author = {Andr{\'{a}}s Hajnal and Gyula O. H. Katona and Attila Sali}, title = {Preface}, journal = {Discret. Math.}, volume = {150}, number = {1-3}, pages = {1}, year = {1996}, url = {https://doi.org/10.1016/0012-365X(96)90032-1}, doi = {10.1016/0012-365X(96)90032-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HajnalKS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/ErdosHSSS94, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal and Mikl{\'{o}}s Simonovits and Vera T. S{\'{o}}s and Endre Szemer{\'{e}}di}, title = {Tur{\'{a}}n-Ramsey Theorems and K\({}^{\mbox{p}}\)-Independence Numbers}, journal = {Comb. Probab. Comput.}, volume = {3}, pages = {297--325}, year = {1994}, url = {https://doi.org/10.1017/S0963548300001218}, doi = {10.1017/S0963548300001218}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/ErdosHSSS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/ErdosHSSS93, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal and Mikl{\'{o}}s Simonovits and Vera T. S{\'{o}}s and Endre Szemer{\'{e}}di}, title = {Tur{\'{a}}n-Ramsey theorems and simple asymptotically extremal structures}, journal = {Comb.}, volume = {13}, number = {1}, pages = {31--56}, year = {1993}, url = {https://doi.org/10.1007/BF01202788}, doi = {10.1007/BF01202788}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/combinatorica/ErdosHSSS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HajnalS93, author = {Andr{\'{a}}s Hajnal and Norbert Sauer}, title = {Cut-sets in infinite graphs and partial orders}, journal = {Discret. Math.}, volume = {117}, number = {1-3}, pages = {113--125}, year = {1993}, url = {https://doi.org/10.1016/0012-365X(93)90328-Q}, doi = {10.1016/0012-365X(93)90328-Q}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HajnalS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HajnalMPST93, author = {Andr{\'{a}}s Hajnal and Wolfgang Maass and Pavel Pudl{\'{a}}k and Mario Szegedy and Gy{\"{o}}rgy Tur{\'{a}}n}, title = {Threshold Circuits of Bounded Depth}, journal = {J. Comput. Syst. Sci.}, volume = {46}, number = {2}, pages = {129--154}, year = {1993}, url = {https://doi.org/10.1016/0022-0000(93)90001-D}, doi = {10.1016/0022-0000(93)90001-D}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/HajnalMPST93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/GerlitsHS92, author = {J{\'{a}}nos Gerlits and Andr{\'{a}}s Hajnal and Zolt{\'{a}}n Szentmikl{\'{o}}ssy}, title = {On the cardinality of certain Hausdorff spaces}, journal = {Discret. Math.}, volume = {108}, number = {1-3}, pages = {31--35}, year = {1992}, url = {https://doi.org/10.1016/0012-365X(92)90657-2}, doi = {10.1016/0012-365X(92)90657-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/GerlitsHS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/AlonH91, author = {Noga Alon and Andr{\'{a}}s Hajnal}, title = {Ramsey graphs contain many distinct induced subgraphs}, journal = {Graphs Comb.}, volume = {7}, number = {1}, pages = {1--6}, year = {1991}, url = {https://doi.org/10.1007/BF01789457}, doi = {10.1007/BF01789457}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/AlonH91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/ErdosHT91, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal and Zsolt Tuza}, title = {Local constraints ensuring small representing sets}, journal = {J. Comb. Theory, Ser. {A}}, volume = {58}, number = {1}, pages = {78--84}, year = {1991}, url = {https://doi.org/10.1016/0097-3165(91)90074-Q}, doi = {10.1016/0097-3165(91)90074-Q}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/ErdosHT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ErdosH89, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal}, title = {Ramsey-type theorems}, journal = {Discret. Appl. Math.}, volume = {25}, number = {1-2}, pages = {37--52}, year = {1989}, url = {https://doi.org/10.1016/0166-218X(89)90045-0}, doi = {10.1016/0166-218X(89)90045-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ErdosH89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ErdosH89, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal}, title = {On the number of distinct induced subgraphs of a graph}, journal = {Discret. Math.}, volume = {75}, number = {1-3}, pages = {145--154}, year = {1989}, url = {https://doi.org/10.1016/0012-365X(89)90085-X}, doi = {10.1016/0012-365X(89)90085-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ErdosH89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HajnalMT88, author = {Andr{\'{a}}s Hajnal and Wolfgang Maass and Gy{\"{o}}rgy Tur{\'{a}}n}, editor = {Janos Simon}, title = {On the Communication Complexity of Graph Properties}, booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, {USA}}, pages = {186--191}, publisher = {{ACM}}, year = {1988}, url = {https://doi.org/10.1145/62212.62228}, doi = {10.1145/62212.62228}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HajnalMT88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/HajnalK87, author = {Andr{\'{a}}s Hajnal and P{\'{e}}ter Komj{\'{a}}th}, title = {Some higher-gap examples in combinatorial set theory}, journal = {Ann. Pure Appl. Log.}, volume = {33}, pages = {283--296}, year = {1987}, url = {https://doi.org/10.1016/0168-0072(87)90084-4}, doi = {10.1016/0168-0072(87)90084-4}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/HajnalK87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HajnalMPST87, author = {Andr{\'{a}}s Hajnal and Wolfgang Maass and Pavel Pudl{\'{a}}k and Mario Szegedy and Gy{\"{o}}rgy Tur{\'{a}}n}, title = {Threshold circuits of bounded depth}, booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987}, pages = {99--110}, publisher = {{IEEE} Computer Society}, year = {1987}, url = {https://doi.org/10.1109/SFCS.1987.59}, doi = {10.1109/SFCS.1987.59}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HajnalMPST87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ErdosFHKRS86, author = {Paul Erd{\"{o}}s and Zolt{\'{a}}n F{\"{u}}redi and Andr{\'{a}}s Hajnal and P{\'{e}}ter Komj{\'{a}}th and Vojtech R{\"{o}}dl and {\'{A}}kos Seress}, title = {Coloring graphs with locally few colors}, journal = {Discret. Math.}, volume = {59}, number = {1-2}, pages = {21--34}, year = {1986}, url = {https://doi.org/10.1016/0012-365X(86)90065-8}, doi = {10.1016/0012-365X(86)90065-8}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/ErdosFHKRS86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HajnalS86, author = {Andr{\'{a}}s Hajnal and Norbert Sauer}, title = {Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets}, journal = {Discret. Math.}, volume = {59}, number = {1-2}, pages = {61--67}, year = {1986}, url = {https://doi.org/10.1016/0012-365X(86)90069-5}, doi = {10.1016/0012-365X(86)90069-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HajnalS86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Hajnal85, author = {Andr{\'{a}}s Hajnal}, title = {The chromatic number of the product of two Alef \({}_{\mbox{i}}\) - Chromatic Graphs can be countable}, journal = {Comb.}, volume = {5}, number = {2}, pages = {137--139}, year = {1985}, url = {https://doi.org/10.1007/BF02579376}, doi = {10.1007/BF02579376}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Hajnal85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ErdosH85, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal}, title = {Chromatic number of finite and infinite graphs and hypergraphs}, journal = {Discret. Math.}, volume = {53}, pages = {281--285}, year = {1985}, url = {https://doi.org/10.1016/0012-365X(85)90148-7}, doi = {10.1016/0012-365X(85)90148-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ErdosH85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/HajnalK84, author = {Andr{\'{a}}s Hajnal and P{\'{e}}ter Komj{\'{a}}th}, title = {What must and what need not be contained in a graph of uncountable chromatic number?}, journal = {Comb.}, volume = {4}, number = {1}, pages = {47--52}, year = {1984}, url = {https://doi.org/10.1007/BF02579156}, doi = {10.1007/BF02579156}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/HajnalK84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/ErdosHSS83, author = {Paul Erd{\"{o}}s and Andr{\'{a}}s Hajnal and Vera T. S{\'{o}}s and Endre Szemer{\'{e}}di}, title = {More results on Ramsey - Tur{\'{a}}n Type problems}, journal = {Comb.}, volume = {3}, number = {1}, pages = {69--81}, year = {1983}, url = {https://doi.org/10.1007/BF02579342}, doi = {10.1007/BF02579342}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/ErdosHSS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/HajnalS83, author = {Andr{\'{a}}s Hajnal and Vera T. S{\'{o}}s}, title = {Paul Erd{\"{o}}s is seventy}, journal = {J. Graph Theory}, volume = {7}, number = {4}, pages = {391--393}, year = {1983}, url = {https://doi.org/10.1002/jgt.3190070403}, doi = {10.1002/JGT.3190070403}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/HajnalS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HajnalR73, author = {Andr{\'{a}}s Hajnal and Bruce Rothschild}, title = {A Generalization of the Erd{\"{o}}s-Ko-Rado Theorem on Finite Set Systems}, journal = {J. Comb. Theory, Ser. {A}}, volume = {15}, number = {3}, pages = {359--362}, year = {1973}, url = {https://doi.org/10.1016/0097-3165(73)90085-X}, doi = {10.1016/0097-3165(73)90085-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/HajnalR73.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.