UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Browse by UCL people

Group by: Type | Date
Jump to: Article
Number of items: 9.

Article

Axenovich, M; Goldwasser, J; Hansen, R; Lidický, B; Martin, RR; Offner, D; Talbot, J; (2018) Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles. Journal of Graph Theory , 87 (4) pp. 660-671. 10.1002/jgt.22180. Green open access
file

Lo, A; Patel, V; Skokan, J; Talbot, J; (2020) Decomposing tournaments into paths. Proceedings of the London Mathematical Society , 121 (2) pp. 426-461. 10.1112/plms.12328. Green open access
file

Lo, A; Patel, V; Skokan, J; Talbot, J; (2017) Decomposing tournaments into paths. Electronic Notes in Discrete Mathematics , 61 pp. 813-818. 10.1016/j.endm.2017.07.040. Green open access
file

Talbot, J; Sanitt, A; (2022) The density Turán problem for hypergraphs. Journal of Combinatorics (In press). Green open access
file

Talbot, John; Yan, Jun; (2024) Degree Sequences of Triangular Multigraphs. The Electronic Journal of Combinatorics , 31 (3) , Article P3.22. 10.37236/12518. Green open access
file

Talbot, J; Axenovich, M; Goldwasser, J; Lidicky, B; Martin, R; Offner, D; Young, M; (2019) Polychromatic Colorings on the Integers. Integers : Electronic Journal of Combinatorial Number Theory , 19 (A18) Green open access
file

Talbot, JM; (2002) Lagrangians of Hypergraphs. Combinatorics, Probability and Computing , 11 (2) pp. 199-216. 10.1017/S0963548301005053. Green open access
file

Talbot, JM; Baber, R; (2014) A solution to the 2/3 conjecture. SIAM Journal on Discrete Mathematics , 28 (2) pp. 756-766. 10.1137/130926614. Green open access
file

Talbot, JM; Sanitt, A; (2015) An exact Turan result for tripartite 3-graphs. The Electronic Journal of Combinatorics , 22 (4) , Article 4.3. Green open access
file

This list was generated on Sun Feb 1 08:36:26 2026 GMT.