Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs
Daniela Kühn
,
Deryk Osthus
Type:
Book-Chapter
Publication Date:
2009-01-01
Citations:
16
Download PDF
Share
Locations
arXiv (Cornell University) -
View
-
PDF
Similar Works
Action
Title
Year
Authors
+
Embedding graphs with bounded degree in sparse pseudorandom graphs
2004
Yoshiharu Kohayakawa
V. Rödl
Papa A. Sissokho
+
Counting sparse induced subgraphs in locally dense graphs
2025
Rajko Nenadov
+
PDF
Chat
Counting Small Induced Subgraphs: Hardness via Fourier Analysis
2025
Radu Curticapean
Daniel Neuen
+
Tree embeddings in dense graphs
2018
Besomi Ormazábal
Guido Andrés
+
Embedding graphs into larger graphs: results, methods, and problems
2019
Miklós Simonovits
Endre Szemerédi
+
Algorithms for dense graphs and networks
1991
Joseph Cheriyan
Kurt Mehlhorn
+
Embedding graphs of small size
1994
Mariusz Woźniak
+
Large planar subgraphs in dense graphs
2005
Daniela Kühn
Deryk Osthus
Anusch Taraz
+
PDF
Chat
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
2019
Miklós Simonovits
Endre Szemerédi
+
Surveys in Combinatorics 2015
2015
Artur Czumaj
Angelos Geōrgakopoylos
Daniel Kráľ
Vadim Lozin
Oleg Pikhurko
+
Embedding trees into graphs of large girth
2000
Penny Haxell
Tomasz Łuczak
+
Counting Subgraphs in Somewhere Dense Graphs
2024
Marco Bressan
Leslie Ann Goldberg
Kitty Meeks
Marc Roth
+
Surveys in combinatorics 2011
2011
Robin Chapman
+
Regular subgraphs of dense graphs
1985
L. Pyber
+
Surveys in Combinatorics 2021
2021
+
PDF
Chat
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
2025
Simon Döring
Dániel Marx
Philip Wellnitz
+
Counting tree-like graphs in locally dense graphs
2017
Joonkyung Lee
+
Packing of graphs and permutations—a survey
2003
Mariusz Woźniak
+
Approximately counting Hamilton cycles in dense graphs
1994
Martin Dyer
Alan Frieze
Mark Jerrum
+
PDF
Chat
In Search of the Densest Subgraph
2019
András Faragó
Zohre R. Mojaveri
Works That Cite This (16)
Action
Title
Year
Authors
+
PDF
Chat
Recent advances on Dirac-type problems for hypergraphs
2016
Yi Zhao
+
PDF
Chat
On the KŁR conjecture in random graphs
2014
David Conlon
W. T. Gowers
Wojciech Samotij
Mathias Schacht
+
$$F$$ F -Factors in Hypergraphs Via Absorption
2014
Allan Lo
Klas Markström
+
Degree versions of theorems on intersecting families via stability
2019
Andrey Kupavskii
+
Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs
2017
Wei Gao
Jie Han
+
PDF
Chat
A multipartite Hajnal–Szemerédi theorem
2015
Peter Keevash
Richard Mycroft
+
PDF
Chat
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
2015
Endre Szemerédi
Maya Stein
Miklós Simonovits
Diana Piguet
Jan Hladký
+
PDF
Chat
Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
2019
Wei Gao
Jie Han
Yi Zhao
+
PDF
Chat
On Komlós’ tiling theorem in random graphs
2019
Rajko Nenadov
Nemanja Škorić
+
PDF
Chat
Factors in randomly perturbed hypergraphs
2021
Yu‐Lin Chang
Jie Han
Yoshiharu Kohayakawa
Patrick Morris
Guilherme Oliveira Mota
Works Cited by This (0)
Action
Title
Year
Authors