Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph

Documenti analoghi

• Turán number of complete bipartite graphs with bounded matching number
  di: Luo, Huan, et al.
  Pubblicazione: (2024)
• Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
  di: Lo, Allan, et al.
  Pubblicazione: (2023)
• Improved bound on the number of edges of diameter-$k$-critical graphs
  di: Wang, Xiaolin, et al.
  Pubblicazione: (2024)
• Some sharp lower bounds for the bipartite Turán number of theta graphs
  di: Theodorakopoulos, Stefanos
  Pubblicazione: (2024)
• Sharp lower bounds and extremal graphs for the generalized $k$-independence number
  di: Huang, Jing, et al.
  Pubblicazione: (2025)