AAAAAA

   
Results: 1-7 |
Results: 7
AN ALGORITHMIC VERSION OF THE BLOW-UP LEMMA
Authors: KOMLOS J SARKOZY GN SZEMEREDI E
Citation: J. Komlos et al., AN ALGORITHMIC VERSION OF THE BLOW-UP LEMMA, Random structures & algorithms, 12(3), 1998, pp. 297-312
MATCHING NUTS AND BOLTS IN O(N LOG N) TIME
Authors: KOMLOS J MA Y SZEMEREDI E
Citation: J. Komlos et al., MATCHING NUTS AND BOLTS IN O(N LOG N) TIME, SIAM journal on discrete mathematics (Print), 11(3), 1998, pp. 347-372
ON THE POSA-SEYMOUR CONJECTURE
Authors: KOMLOS J SARKOZY GN SZEMEREDI E
Citation: J. Komlos et al., ON THE POSA-SEYMOUR CONJECTURE, Journal of graph theory, 29(3), 1998, pp. 167-176
BLOW-UP LEMMA
Authors: KOMLOS J SARKOZY GN SZEMEREDI E
Citation: J. Komlos et al., BLOW-UP LEMMA, Combinatorica, 17(1), 1997, pp. 109-123
ON THE SQUARE OF A HAMILTONIAN CYCLE IN DENSE GRAPHS
Authors: KOMLOS J SARKOZY GN SZEMEREDI E
Citation: J. Komlos et al., ON THE SQUARE OF A HAMILTONIAN CYCLE IN DENSE GRAPHS, Random structures & algorithms, 9(1-2), 1996, pp. 193-211
ON THE PROBABILITY THAT A RANDOM + -1-MATRIX IS SINGULAR/
Authors: KAHN J KOMLOS J SZEMEREDI E
Citation: J. Kahn et al., ON THE PROBABILITY THAT A RANDOM + -1-MATRIX IS SINGULAR/, Journal of the American Mathematical Society, 8(1), 1995, pp. 223-240
DENSE GRAPHS WITHOUT 3-REGULAR SUBGRAPHS
Authors: PYBER L RODL V SZEMEREDI E
Citation: L. Pyber et al., DENSE GRAPHS WITHOUT 3-REGULAR SUBGRAPHS, J COMB TH B, 63(1), 1995, pp. 41-54
Risultati: 1-7 |