Now showing items 1-4 of 4

  • Every tree is a large subtree of a tree that decomposes Kn or Kn,n 

    Lladó Sánchez, Ana M.; López Masip, Susana Clara; Moragas Vilarnau, Jordi (2010-02-28)
    Article
    Restricted access - publisher's policy
    Let T be a tree with m edges. A well-known conjecture of Ringel states that T decomposes the complete graph $K_{2m+1}$. Graham and Häggkvist conjectured that T also decomposes the complete bipartite graph $K_{m,m}$. In ...
  • Graph labelings and decompositions by partitioning sets of integers 

    Moragas Vilarnau, Jordi (Universitat Politècnica de Catalunya, 2010-06-14)
    Doctoral thesis
    Open Access
  • On the ASD conjecture 

    Lladó Sánchez, Ana M.; Moragas Vilarnau, Jordi (2010)
    Conference report
    Restricted access - publisher's policy
    Let G be a graph of size ($\displaystyle\frac{n+1}{2}$) for some integer n ≥ 1. G is said to have an ascending subgraph decomposition (ASD) if can be decomposed into n subgraphs H1, . . . ,Hn such that Hi has i edges and ...
  • Partición de un conjunto de enteros con sumas prescritas 

    Lladó Sánchez, Ana M.; Moragas Vilarnau, Jordi (2008)
    Conference report
    Restricted access - publisher's policy
    Sea X un conjunto de n enteros y M = {m1 ≥ · · · ≥ mk} una secuencia de enteros positivos. El problema consiste en encontrar una partici´on de X en k subconjuntos mutuamente disjuntos X1, . . . ,Xk tal que la suma de los ...