Exploració per autor "Lladó Sánchez, Ana M."
Ara es mostren els items 1-20 de 21
-
Almost every tree with m edges decomposes K2m,2m
Drmota, Michael; Lladó Sánchez, Ana M. (2014-01)
Article
Accés obertWe show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K2m,2m, a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost ... -
Approximate results for rainbow labelings
Lladó Sánchez, Ana M.; Miller, Mirka (2017-03)
Article
Accés obertA simple graph G=(V,E) is said to be antimagic if there exists a bijection f:E¿[1,|E|] such that the sum of the values of f on edges incident to a vertex takes different values on distinct vertices. The graph G is distance ... -
Approximate results for rainbow labelings
Lladó Sánchez, Ana M. (2015-04-14)
Report de recerca
Accés obert -
Àlgebra lineal : interpretació matricial amb problemes resolts
Lladó Sánchez, Ana M. (Iniciativa Digital Politècnica. Oficina de Publicacions Acadèmiques Digitals de la UPC, 2022-10)
Llibre
Accés restringit a la comunitat UPCAquest text conté una introducció a l’àlgebra lineal com a eina imprescindible per a la resolució de sistemes lineals. Aquest problema es planteja tant per a sistemes consistents com per a aquells sistemes que no tenen ... -
Cycle-magic graphs
Lladó Sánchez, Ana M.; Moragas, J (2007-09)
Article
Accés restringit per política de l'editorialA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given cycle C. Then the graph G is C-magic if there exists a total labelling f : V ∪ E → {1, 2, . . ... -
Decomposing almost complete graphs by random trees
Lladó Sánchez, Ana M. (2018-02)
Article
Accés obertAn old conjecture of Ringel states that every tree with m edges decomposes the complete graph K2m+1. The best known lower bound for the order of a complete graph which admits a decomposition by every given tree with m edges ... -
Decomposing almost complete graphs by random trees
Lladó Sánchez, Ana M. (2015-04-14)
Report de recerca
Accés obert -
Decomposing almost complete graphs by random trees
Lladó Sánchez, Ana M. (2014)
Text en actes de congrés
Accés restringit per política de l'editorialAn old conjecture of Ringel states that every tree with m edges decom- poses the complete graph K 2 m +1 . A more general version of the Ringel’s conjecture says that every tree with m edges decomposes K rm +1 for each r ... -
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
Accés restringit per política de l'editorialLet 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 ... -
Funcions de variables complexa : notes de classe
Lladó Sánchez, Ana M. (Universitat Politècnica de Catalunya, 2012-06)
Apunts
Accés obert -
Matemática discreta
Comellas Padró, Francesc de Paula; Fàbrega Canudas, José; Lladó Sánchez, Ana M.; Serra Albó, Oriol (Edicions UPC, 2001)
Llibre
Accés restringit a la comunitat UPCLa matemàtica discreta és la part de les matemàtiques que tracta de les estructures finites i numerables. Aquesta nova branca de les matemàtiques ha rebut un impuls decisiu amb els progressos de la informàtica i de les ... -
On star forest ascending subgraph decomposition
Aroca Farrerons, José María; Lladó Sánchez, Ana M. (2017-02-03)
Article
Accés obertThe Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with (n+12) edges admits an edge decomposition G=H1¿¿¿Hn such that Hi has i edges and it is isomorphic to a subgraph of Hi+1, i=1,…,n-1. We ... -
On star-forest ascending subgraph decomposition
Aroca Farrerons, José María; Lladó Sánchez, Ana M. (2015-04-14)
Report de recerca
Accés obert -
On the ascending subgraph decomposition problem for bipartite graphs
Aroca Farrerons, José María; Lladó Sánchez, Ana M. (2014-09)
Article
Accés obertThe Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with View the MathML source(n+12) edges admits an edge decomposition G=H1¿¿¿HnG=H1¿¿¿Hn such that HiHi has i edges and is isomorphic to ... -
On the ASD conjecture
Lladó Sánchez, Ana M.; Moragas Vilarnau, Jordi (2010)
Text en actes de congrés
Accés restringit per política de l'editorialLet 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)
Text en actes de congrés
Accés restringit per política de l'editorialSea 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 ... -
Sèries de Fourier : notes de classe
Lladó Sánchez, Ana M. (Universitat Politècnica de Catalunya, 2012-02)
Apunts
Accés obert -
The partial line digraph technique in the design of large interconnection networks
Fiol Mora, Miquel Àngel; Lladó Sánchez, Ana M. (1992-07)
Article
Accés restringit per política de l'editorialThe following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum out-degree, reduced diameter, easy routing, good connectivity, and ... -
Transformada de Fourier : notes de classe
Lladó Sánchez, Ana M. (Universitat Politècnica de Catalunya, 2012-03)
Apunts
Accés obert -
Vertex-transitive graphs that remain connected after failure of a vertex an its neighbors
Hamidoune, Yahya Ould; Lladó Sánchez, Ana M.; López Masip, Susana Clara (Wiley InterScience, 2010)
Article
Accés restringit per política de l'editorialA d-regular graph is said to be superconnected if any disconnecting subset with cardinality at most d is formed by the neighbors of some vertex. A superconnected graph that remains connected after the failure of a vertex ...