2 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Czech Academy of Sciences, Institute of Computer ScienceCZ4 papers
- Czech Academy of Sciences, Institute of SociologyCZ4 papers
- Charles UniversityCZ2 papers
- Aix-Marseille UniversitéFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Czech Academy of SciencesCZ1 paper
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ1 paper
- Laboratoire d’Informatique et SystèmesFR1 paper
- Luxembourg Institute of Science and TechnologyLU1 paper
- Rensselaer Polytechnic InstituteUS1 paper
- University of LuxembourgLU1 paper
Showing math.COShow all
2 papers · 1 filter
math.CO2023★ 2 cited
Random minimum spanning tree and dense graph limits
Jan Hladký, Gopal Viswanathan
A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph whose edges get independent weights from the distribution $UNIF…
math.CO2022★ 1 cited
Prominent examples of flip processes
Pedro Araújo, Jan Hladký, Eng Keat Hng +1
Flip processes, introduced in [Garbe, Hladký, Šileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule w…