AAAAAA
Results: 1-25/187
Authors:
Babai, L
Hayes, TP
Kimmel, PG
Citation: L. Babai et al., The cost of the missing bit: Communication complexity with help, COMBINATORI, 21(4), 2001, pp. 455-488
Authors:
Houdre, C
Citation: C. Houdre, Mixed and isoperimetric estimates on the log-Sobolev constants of graphs and Markov chains, COMBINATORI, 21(4), 2001, pp. 489-513
Authors:
Kostochka, AV
Woodall, DR
Citation: Av. Kostochka et Dr. Woodall, Density conditions for panchromatic colourings of hypergraphs, COMBINATORI, 21(4), 2001, pp. 515-541
Authors:
Laurent, M
Citation: M. Laurent, On the sparsity order of a graph and its deficiency in chordality, COMBINATORI, 21(4), 2001, pp. 543-570
Authors:
Lunardon, G
Citation: G. Lunardon, Linear k-blocking sets, COMBINATORI, 21(4), 2001, pp. 571-581
Authors:
Nedela, R
Skoviera, M
Citation: R. Nedela et M. Skoviera, Cayley snarks and almost simple groups, COMBINATORI, 21(4), 2001, pp. 583-590
Authors:
Stanchescu, YV
Citation: Yv. Stanchescu, An upper bound for d-dimensional difference sets, COMBINATORI, 21(4), 2001, pp. 591-595
Authors:
Axenovich, M
Kundgen, A
Citation: M. Axenovich et A. Kundgen, On a generalized anti-Ramsey problem, COMBINATORI, 21(3), 2001, pp. 335-349
Authors:
Jendrol, S
Schiermeyer, I
Citation: S. Jendrol et I. Schiermeyer, On a max-min problem concerning weights of edges, COMBINATORI, 21(3), 2001, pp. 351-359
Authors:
Marcotte, O
Citation: O. Marcotte, Optimal edge-colourings for a class of planar multigraphs, COMBINATORI, 21(3), 2001, pp. 361-394
Authors:
Mohar, B
Citation: B. Mohar, Existence of polyhedral embeddings of graphs, COMBINATORI, 21(3), 2001, pp. 395-401
Authors:
Pikhurko, O
Citation: O. Pikhurko, Size Ramsey numbers of stars versus 3-chromatic graphs, COMBINATORI, 21(3), 2001, pp. 403-412
Authors:
Podoski, K
Citation: K. Podoski, Groups covered by an infinite number of Abelian subgroups, COMBINATORI, 21(3), 2001, pp. 413-416
Authors:
Thomassen, C
Citation: C. Thomassen, Totally odd K-4-subdivisions in 4-chromatic graphs, COMBINATORI, 21(3), 2001, pp. 417-443
Authors:
Fleiner, T
Citation: T. Fleiner, The size of 3-cross-free families, COMBINATORI, 21(3), 2001, pp. 445-448
Authors:
Kyureghyan, GM
Citation: Gm. Kyureghyan, On a degree property of cross-intersecting families, COMBINATORI, 21(3), 2001, pp. 449-453
Authors:
Alon, N
Pach, J
Solymosi, J
Citation: N. Alon et al., Ramsey-type theorems with forbidden subgraphs, COMBINATORI, 21(2), 2001, pp. 155-170
Authors:
Bohman, T
Frieze, A
Ruszinko, M
Thoma, L
Citation: T. Bohman et al., Vertex covers by edge disjoint cliques, COMBINATORI, 21(2), 2001, pp. 171-197
Authors:
Graham, RL
Rodl, V
Rucinski, A
Citation: Rl. Graham et al., On bipartite graphs with linear Ramsey numbers, COMBINATORI, 21(2), 2001, pp. 199-209
Authors:
Katznelson, Y
Citation: Y. Katznelson, Chromatic numbers of Cayley graphs on Z and recurrence, COMBINATORI, 21(2), 2001, pp. 211-219
Authors:
Kleitman, DJ
Gyarfas, A
Toth, G
Citation: Dj. Kleitman et al., Convex sets in the plane with three of every four meeting, COMBINATORI, 21(2), 2001, pp. 221-232
Authors:
Komjath, P
Citation: P. Komjath, Some remarks on obligatory subsystems of uncountably chromatic triple systems, COMBINATORI, 21(2), 2001, pp. 233-238
Authors:
Korevaar, J
Citation: J. Korevaar, Tauberian theorem of Erdos revisited, COMBINATORI, 21(2), 2001, pp. 239-250
Authors:
Mader, W
Citation: W. Mader, Subdivisions of a graph of maximal degree n+1 in graphs of average degree n+epsilon and large girth, COMBINATORI, 21(2), 2001, pp. 251-265
Authors:
Rautenbach, D
Reed, B
Citation: D. Rautenbach et B. Reed, The Erdos-Posa property for odd cycles in highly connected graphs, COMBINATORI, 21(2), 2001, pp. 267-278