E-LIB Suche - Ergebnisse für: Michaeli, Peleg

1

Discrepancies of Subtrees:

, In: AIRO Springer Series; Graphs and Combinatorial Optimization: from Theory to Applications,

Krishna, Tarun ; Michaeli, Peleg ; Sarantis, Michail.. - p. 81-93 , 2024

Link: https://doi.org/10.1007/..

2

Oriented discrepancy of Hamilton cycles:

Gishboliner, Lior ; Krivelevich, Michael ; Michaeli, Peleg
Journal of Graph Theory. 103 (2023) 4 - p. 780-792 , 2023

Link: https://doi.org/10.1002/..

3

Greedy maximal independent sets via local limits:

Krivelevich, Michael ; Mészáros, Tamás ; Michaeli, Peleg.
Random Structures & Algorithms. 64 (2023) 4 - p. 986-1015 , 2023

Link: https://doi.org/10.1002/..

4

Discrepancies of spanning trees and Hamilton cycles:

Gishboliner, Lior ; Krivelevich, Michael ; Michaeli, Peleg
Journal of Combinatorial Theory, Series B. 154 (2022) - p. 262-291 , 2022

Link: https://doi.org/10.1016/..

5

Spanning Trees at the Connectivity Threshold:

Alon, Yahav ; Krivelevich, Michael ; Michaeli, Peleg
SIAM Journal on Discrete Mathematics. 36 (2022) 3 - p. 1612-1626 , 2022

Link: https://doi.org/10.1137/..

6

Color‐biased Hamilton cycles in random graphs:

Gishboliner, Lior ; Krivelevich, Michael ; Michaeli, Peleg
Random Structures & Algorithms. 60 (2021) 3 - p. 289-307 , 2021

Link: https://doi.org/10.1002/..

7

The diameter of uniform spanning trees in high dimensions:

Michaeli, Peleg ; Nachmias, Asaf ; Shalev, Matan
Probability Theory and Related Fields. 179 (2020) 1-2 - p. 261-294 , 2020

Link: https://doi.org/10.1007/..

8

On the trace of random walks on random graphs:

Frieze, Alan ; Krivelevich, Michael ; Michaeli, Peleg.
Proceedings of the London Mathematical Society. 116 (2017) 4 - p. 847-877 , 2017

Link: https://doi.org/10.1112/..

9

Discrepancies of subtrees:

Krishna, Tarun ; Michaeli, Peleg ; Sarantis, Michail..
http://arxiv.org/abs/2302.08557. , 2023

Link: http://arxiv.org/abs/230..

10

Oriented discrepancy of Hamilton cycles:

Gishboliner, Lior ; id_orcid:0 000-0003-0688-8111 ; Krivelevich, Michael.
info:eu-repo/semantics/altIdentifier/doi/10.1002/jgt.22947. , 2023

Link: https://hdl.handle.net/2..

11

Rigid partitions: from high connectivity to random graphs:

Krivelevich, Michael ; Lew, Alan ; Michaeli, Peleg
http://arxiv.org/abs/2311.14451. , 2023

Link: http://arxiv.org/abs/231..

12

Discrepancies of spanning trees and Hamilton cycles:

Gishboliner, Lior ; id_orcid:0 000-0003-0688-8111 ; Krivelevich, Michael.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.jctb.2022.01.003. , 2022

Link: https://hdl.handle.net/2..

13

Fast construction on a restricted budget:

Frieze, Alan ; Krivelevich, Michael ; Michaeli, Peleg
http://arxiv.org/abs/2207.07251. , 2022

Link: http://arxiv.org/abs/220..

14

Oriented discrepancy of Hamilton cycles:

Gishboliner, Lior ; Krivelevich, Michael ; Michaeli, Peleg
http://arxiv.org/abs/2203.07148. , 2022

Link: http://arxiv.org/abs/220..

15

Karp's patching algorithm on random perturbations of dense ..:

Frieze, Alan ; Michaeli, Peleg
http://arxiv.org/abs/2209.06279. , 2022

Link: http://arxiv.org/abs/220..