No article text was recorded for this version.
absorbing method
Version 1 of 110 papers16 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A generalization of the Hamiltonian cycle in dense digraphs
- Blog: Almost all optimally coloured complete graphs contain a rainbow Hamilton path
- Blog: A better bound on the size of rainbow matchings
- Blog: Rainbow Perfect Matchings for 4-Uniform Hypergraphs
- Blog: Cycle-factors in oriented graphs
- Blog: Counting Hamilton cycles in Dirac hypergraphs
- Blog: Hamilton transversals in random Latin squares
- Blog: Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
- Blog: Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Blog: H-Factors in Dense Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_absorbing_method_51002161,
title = {absorbing method},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/absorbing-method/rdr_510021612c83434e95898b97424e8695},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_absorbing_method_51002161_v1,
title = {absorbing method},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/absorbing-method/rdr_510021612c83434e95898b97424e8695/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}