Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
H-packing of k-chromatic graphs
Raphael Yuster
Type:
Article
Publication Date:
2012-01-01
Citations:
6
Share
Similar Works
Action
Title
Year
Authors
+
Packing k-partite k-uniform hypergraphs
2014
Richard Mycroft
+
Packing k-partite k-uniform hypergraphs
2014
Richard Mycroft
+
PDF
Chat
Clumsy Packings of Graphs
2019
Maria Axenovich
Anika Kaufmann
Raphael Yuster
+
Clumsy packings of graphs
2018
Maria Axenovich
Anika Kaufmann
Raphael Yuster
+
Packing k-partite k-uniform hypergraphs
2015
Richard Mycroft
+
The Complexity of Perfect Packings in Dense Graphs
2017
Jie Han
+
The mod $k$ chromatic index of graphs is $O(k)$
2020
Fábio Botler
Lucas Colucci
Yoshiharu Kohayakawa
+
PDF
Chat
An Ore-type Theorem for Perfect Packings in Graphs
2009
Daniela Kühn
Deryk Osthus
Andrew Treglown
+
An Ore-type theorem for perfect packings in graphs
2008
Daniela Kühn
Deryk Osthus
Andrew Treglown
+
PDF
Chat
Packing k-partite k-uniform hypergraphs
2011
Richard Mycroft
+
PDF
Chat
Packing chromatic number versus chromatic and clique number
2017
Boštjan Brešar
Sandi Klavžar
Douglas F. Rall
Kirsti Wash
+
Packing list-colourings.
2021
Stijn Cambie
Wouter Cames van Batenburg
Ewan Davies
Ross J. Kang
+
Counting and packing Hamilton $\ell$-cycles in dense hypergraphs
2014
Asaf Ferber
Michael Krivelevich
Benny Sudakov
+
Critical chromatic number and the complexity of perfect packings in graphs
2006
Daniela Kühn
Deryk Osthus
+
PDF
Chat
Critical chromatic number and the complexity of perfect packings in graphs
2006
Daniela Kühn
Deryk Osthus
+
Packing list-colourings
2021
Stijn Cambie
Wouter Cames van Batenburg
Ewan Davies
Ross J. Kang
+
Maximising $H$-Colourings of Graphs
2016
Hannah Guggiari
Alex Scott
+
Maximising $H$-Colourings of Graphs
2016
Hannah Guggiari
Alex Scott
+
Minimal H-factors and covers
2023
Lorenzo Federico
Joel Larsson Danielsson
+
The minimum degree threshold for perfect graph packings
2006
Daniela Kühn
Deryk Osthus
Works That Cite This (6)
Action
Title
Year
Authors
+
PDF
Chat
Edge-decompositions of graphs with high minimum degree
2015
Ben Barber
Daniela Kühn
Allan Lo
Deryk Osthus
+
Edge-decompositions of graphs with high minimum degree
2015
Ben Barber
Daniela Kühn
Allan Lo
Deryk Osthus
+
On the decomposition threshold of a given graph
2019
Stefan Glock
Daniela Kühn
Allan Lo
Richard Montgomery
Deryk Osthus
+
Edge-Disjoint Cliques in Graphs with High Minimum Degree
2014
Raphael Yuster
+
PDF
Chat
Extremal aspects of graph and hypergraph decomposition problems
2021
Stefan Glock
Daniela Kühn
Deryk Osthus
+
On the decomposition threshold of a given graph
2016
Stefan Glock
Daniela Kühn
Allan Lo
Richard Montgomery
Deryk Osthus
Works Cited by This (14)
Action
Title
Year
Authors
+
Extremal Graph Theory
1978
Béla Bollobás
+
Szemeredi''s Regularity Lemma and its applications in graph theory
1995
János Komlós
Miklós Simonovits
+
Asymptotically optimal<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-packings of dense graphs via fractional<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-decompositions
2005
Raphael Yuster
+
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
1995
Richard A. Duke
Hanno Lefmann
V. Rödl
+
H-Factors in Dense Graphs
1996
Noga Alon
Raphael Yuster
+
Matchings and covers in hypergraphs
1988
Zoltán Füredi
+
PDF
Chat
Proof of the Alon–Yuster conjecture
2001
János Komlós
Gábor N. Sárközy
Endre Szemerédi
+
Integer and Fractional Packings in Dense Graphs
2001
Penny Haxell
V. Rödl
+
PDF
Chat
On the structure of linear graphs
1946
Paul Erdős
A. H. Stone
+
Packing triangles in a graph and its complement
2004
Peter Keevash
Benny Sudakov