Rainbow H-factors of complete s-uniform r-partite hypergraphs

MaRDI QIDQ1010683zbMATH OpenFDO

Authors Hao Li, Ai Lian Chen, Fuji Zhang

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/129821, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1n26.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

complete hypergraphr-partite hypergraphuniform hypergraphvertex partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Rainbow \(H\)-factors
• Rainbow factors in hypergraphs
• Covering complete partite hypergraphs by monochromatic components
• On the existence of a rainbow 1‐factor in 1‐factorizations of K
• Edge coloring complete uniform hypergraphs with many components

Cited in

(4)

• Rainbow factors in hypergraphs
• The edge coloring number of generalized complete r-partitioned hypergraph
• On the existence of a rainbow 1‐factor in 1‐factorizations of K
• Rainbow \(H\)-factors

This page was built for publication: Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010683)