Mol, Lucas

1. On the Mean Subtree Order of Graphs Under Edge Addition
   2019/11/13 by Ben Cameron, Lucas Mol, Cameron, Ben +1 · 1 citation
   Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Limits and Structures in Graph Theory
2. The Number of Threshold Words on n Letters Grows Exponentially for Every n≥ 27
   2019/11/13 by Currie, James D., Mol, Lucas, Rampersad, Narad · 1 citation
   #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
3. On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs
   2021/06/08 by Lucas Mol, Mol, Lucas, Ortrud R. Oellermann +3 · 1 citation
   Computer Science · Materials Science · #05C35 #05C40 #05C75 #Carbon and Quantum Dots Applications #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Interconnection Networks and Systems #Mobile Ad Hoc Networks
4. The repetition threshold for ternary rich words
   2024/09/18 by Currie, James D., Mol, Lucas, Peltomäki, Jarkko · 1 citation
   #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)