On the ascending subgraph decomposition problem for bipartite graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/26088

Title:	On the ascending subgraph decomposition problem for bipartite graphs
Author:	Aroca Farrerons, José María; Lladó Sánchez, Ana M.
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
Abstract:	The 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 a subgraph of Hi+1Hi+1, i=1,…,n-1i=1,…,n-1. We show that every bipartite graph G with View the MathML source(n+12) edges such that the degree sequence d1,…,dkd1,…,dk of one of the stable sets satisfies di=n-i+2di=n-i+2, 1=i
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria -Combinations -Ascending subgraph decomposition -Sumset partition problem -Combinacions (Matemàtica)
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Published version Article
Share: