Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs

Type: Book-Chapter

Publication Date: 2009-01-01

Citations: 16

Download PDF

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 Cited by This (0)

Action Title Year Authors