H-Decomposition of r-Graphs when H is an r-Graph with Exactly k Independent Edges
Sign Up to like & getrecommendations! Published in 2019 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-018-1988-3
Abstract: Let $$\phi _H^r(n)$$ϕHr(n) be the smallest integer such that, for all r-graphs G on n vertices, the edge set E(G) can be partitioned into at most $$\phi _H^r(n)$$ϕHr(n) parts, of which every part either is… read more here.
Keywords: graph; independent edges; value phi; graph exactly ... See more keywords