|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | András Hajnal |
In memory of László Kalmár.  |
Acta Cybern.  |
2007 |
DBLP BibTeX RDF |
|
| 1 | András Hajnal, Péter Komjáth |
Some Remarks on the Simultaneous Chromatic Number. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 03E35, 05C15 |
| 1 | James E. Baumgartner, András Hajnal |
Polarized Partition Relations. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | András Hajnal, Gyula O. H. Katona, Attila Sali |
Preface. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi |
Turán-Ramsey Theorems and Kp-Independence Numbers. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, N. Sauer |
Cut-sets in infinite graphs and partial orders. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Combinatorica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán |
Threshold Circuits of Bounded Depth. |
J. Comput. Syst. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | János Gerlits, András Hajnal, Z. Szentmiklóssy |
On the cardinality of certain Hausdorff spaces. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Zsolt Tuza |
Local constraints ensuring small representing sets. |
J. Comb. Theory, Ser. A |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, András Hajnal |
Ramsey graphs contain many distinct induced subgraphs. |
Graphs and Combinatorics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal |
On the number of distinct induced subgraphs of a graph. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal |
Ramsey-type theorems. |
Discrete Applied Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Wolfgang Maass, György Turán |
On the Communication Complexity of Graph Properties |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán |
Threshold circuits of bounded depth |
FOCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, N. Sauer |
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal |
Chromatic number of finite and infinite graphs and hypergraphs. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal |
The chromatic number of the product of two Alef i - Chromatic Graphs can be countable. |
Combinatorica |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Péter Komjáth |
What must and what need not be contained in a graph of uncountable chromatic number?. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi |
More results on Ramsey - Turán Type problems. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | András Hajnal, Bruce Rothschild |
A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems. |
J. Comb. Theory, Ser. A |
1973 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")