Show simple item record

dc.contributor.authorCaro, Y.
dc.contributor.authorHansberg Pastor, Adriana
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.date.accessioned2013-03-01T10:55:55Z
dc.date.created2012-08
dc.date.issued2012-08
dc.identifier.citationCaro, Y.; Hansberg, A. Degrees in oriented hypergraphs and Ramsey p-chromatic number. "Electronic journal of combinatorics", Agost 2012, vol. 19, núm. 3.
dc.identifier.issn1077-8926
dc.identifier.urihttp://hdl.handle.net/2117/18031
dc.description.abstractThe family D(k,m) of graphs having an orientation such that for every vertex v ∈ V (G) either (outdegree) deg+(v) ≤ k or (indegree) deg−(v) ≤ m have been investigated recently in several papers because of the role D(k,m) plays in the efforts to estimate the maximum directed cut in digraphs and the minimum cover of digraphs by directed cuts. Results concerning the chromatic number of graphs in the family D(k,m) have been obtained via the notion of d-degeneracy of graphs. In this paper we consider a far reaching generalization of the family D(k,m), in a complementary form, into the context of r-uniform hypergraphs, using a generalization of Hakimi’s theorem to r-uniform hypergraphs and by showing
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject.lcshGraph theory
dc.subject.otherChromatic number
dc.subject.otherD-degenerate hy- pergraph
dc.subject.otherOriented hypergraphs
dc.subject.otherRamsey numbers
dc.subject.otherRamsey p-chromatic number
dc.titleDegrees in oriented hypergraphs and Ramsey p-chromatic number
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
dc.description.peerreviewedPeer Reviewed
dc.subject.ams05C Teoria de grafs
dc.relation.publisherversionhttp://arxiv.org/pdf/1112.3302v1.pdf
dc.rights.accessRestricted access - publisher's policy
drac.iddocument10956810
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorCaro, Y.; Hansberg, A.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameElectronic journal of combinatorics
upcommons.citation.volume19
upcommons.citation.number3


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain