Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-11
|
Results: 11
FINDING A LARGE HIDDEN CLIQUE IN A RANDOM GRAPH
Authors:
ALON N KRIVELEVICH M SUDAKOV B
Citation:
N. Alon et al., FINDING A LARGE HIDDEN CLIQUE IN A RANDOM GRAPH, Random structures & algorithms, 13(3-4), 1998, pp. 457-466
THE CHROMATIC-NUMBERS OF RANDOM HYPERGRAPHS
Authors:
KRIVELEVICH M SUDAKOV B
Citation:
M. Krivelevich et B. Sudakov, THE CHROMATIC-NUMBERS OF RANDOM HYPERGRAPHS, Random structures & algorithms, 12(4), 1998, pp. 381-403
COLORING RANDOM GRAPHS
Authors:
KRIVELEVICH M SUDAKOV B
Citation:
M. Krivelevich et B. Sudakov, COLORING RANDOM GRAPHS, Information processing letters, 67(2), 1998, pp. 71-74
SUBGRAPHS WITH A LARGE COCHROMATIC NUMBER
Authors:
ALON N KRIVELEVICH M SUDAKOV B
Citation:
N. Alon et al., SUBGRAPHS WITH A LARGE COCHROMATIC NUMBER, Journal of graph theory, 25(4), 1997, pp. 295-297
THE CONCENTRATION OF THE CHROMATIC NUMBER OF RANDOM GRAPHS
Authors:
ALON N KRIVELEVICH M
Citation:
N. Alon et M. Krivelevich, THE CONCENTRATION OF THE CHROMATIC NUMBER OF RANDOM GRAPHS, Combinatorica, 17(3), 1997, pp. 303-313
ON THE MINIMAL NUMBER OF EDGES IN COLOR-CRITICAL GRAPHS
Authors:
KRIVELEVICH M
Citation:
M. Krivelevich, ON THE MINIMAL NUMBER OF EDGES IN COLOR-CRITICAL GRAPHS, Combinatorica, 17(3), 1997, pp. 401-426
APPROXIMATE SET COVERING IN UNIFORM HYPERGRAPHS
Authors:
KRIVELEVICH M
Citation:
M. Krivelevich, APPROXIMATE SET COVERING IN UNIFORM HYPERGRAPHS, Journal of algorithms, 25(1), 1997, pp. 118-143
PERFECT FRACTIONAL MATCHINGS IN RANDOM HYPERGRAPHS
Authors:
KRIVELEVICH M
Citation:
M. Krivelevich, PERFECT FRACTIONAL MATCHINGS IN RANDOM HYPERGRAPHS, Random structures & algorithms, 9(3), 1996, pp. 317-334
ON K-SATURATED GRAPHS WITH RESTRICTIONS ON THE DEGREES
Authors:
ALON N ERDOS P HOLZMAN R KRIVELEVICH M
Citation:
N. Alon et al., ON K-SATURATED GRAPHS WITH RESTRICTIONS ON THE DEGREES, Journal of graph theory, 23(1), 1996, pp. 1-20
BOUNDING RAMSEY NUMBERS THROUGH LARGE DEVIATION INEQUALITIES
Authors:
KRIVELEVICH M
Citation:
M. Krivelevich, BOUNDING RAMSEY NUMBERS THROUGH LARGE DEVIATION INEQUALITIES, Random structures & algorithms, 7(2), 1995, pp. 145-155
ON THE EDGE DISTRIBUTION IN TRIANGLE-FREE GRAPHS
Authors:
KRIVELEVICH M
Citation:
M. Krivelevich, ON THE EDGE DISTRIBUTION IN TRIANGLE-FREE GRAPHS, J COMB TH B, 63(2), 1995, pp. 245-260
Risultati:
1-11
|