Rainbow trees in uniformly edge-colored graphs. Aigner-Horev, E., Hefetz, D., & Lahiri, A. Random Struct. Algorithms, 62(2):287–303, 2023.
Rainbow trees in uniformly edge-colored graphs [link]Paper  doi  bibtex   
@article{DBLP:journals/rsa/AignerHorevHL23,
  author       = {Elad Aigner{-}Horev and
                  Dan Hefetz and
                  Abhiruk Lahiri},
  title        = {Rainbow trees in uniformly edge-colored graphs},
  journal      = {Random Struct. Algorithms},
  volume       = {62},
  number       = {2},
  pages        = {287--303},
  year         = {2023},
  url          = {https://doi.org/10.1002/rsa.21103},
  doi          = {10.1002/RSA.21103},
  timestamp    = {Tue, 21 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/AignerHorevHL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0