András Hajnal

According to our database1, András Hajnal authored at least 25 papers between 1973 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
Paul Erdős' Set Theory.
Proceedings of the Mathematics of Paul Erdős II, 2013

2007
In memory of László Kalmár.
Acta Cybern., 2007

2003
Some Remarks on the Simultaneous Chromatic Number.
Combinatorica, 2003

2001
Polarized Partition Relations.
J. Symb. Log., 2001

1996
Preface.
Discrete Mathematics, 1996

1994
Turán-Ramsey Theorems and Kp-Independence Numbers.
Combinatorics, Probability & Computing, 1994

1993
Threshold Circuits of Bounded Depth.
J. Comput. Syst. Sci., 1993

Cut-sets in infinite graphs and partial orders.
Discrete Mathematics, 1993

Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica, 1993

1992
On the cardinality of certain Hausdorff spaces.
Discrete Mathematics, 1992

1991
Local constraints ensuring small representing sets.
J. Comb. Theory, Ser. A, 1991

Ramsey graphs contain many distinct induced subgraphs.
Graphs and Combinatorics, 1991

1989
On the number of distinct induced subgraphs of a graph.
Discrete Mathematics, 1989

Ramsey-type theorems.
Discrete Applied Mathematics, 1989

1988
On the Communication Complexity of Graph Properties
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

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

Threshold circuits of bounded depth
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.
Discrete Mathematics, 1986

Coloring graphs with locally few colors.
Discrete Mathematics, 1986

1985
Chromatic number of finite and infinite graphs and hypergraphs.
Discrete Mathematics, 1985

The chromatic number of the product of two Alef i - Chromatic Graphs can be countable.
Combinatorica, 1985

1984
What must and what need not be contained in a graph of uncountable chromatic number?.
Combinatorica, 1984

1983
Paul Erdös is seventy.
Journal of Graph Theory, 1983

More results on Ramsey - Turán Type problems.
Combinatorica, 1983

1973
A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems.
J. Comb. Theory, Ser. A, 1973


  Loading...