Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587): Difference between revisions

A quasi-random graph sequence \(G(n)\) is defined consisting of sparse graphs of increasing order \(n\). Conditions are given to find in \(G(n)\) the asymptotic number of labeled copies of a fixed triangle-free graph \(H\).

0 references

zbMATH Keywords

quasi-random graph

0 references

triangle-free graph

0 references

graph embedding

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Eigenvalues and expanders

0 references

Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory

0 references

Explicit Ramsey graphs and orthonormal labelings

0 references

Explicit construction of linear sized tolerant networks

0 references

The Algorithmic Aspects of the Regularity Lemma

0 references

Q2784326

0 references

Quasi-random tournaments

0 references

Sparse quasi-random graphs

0 references

Quasi-random graphs

0 references

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph

0 references

The number of submatrices of a given type in a Hadamard matrix and related results

0 references

Q4519896

0 references

Szemerédi’s Regularity Lemma for Sparse Graphs

0 references

Regular pairs in sparse random graphs I

0 references

The Turn Theorem for Random Graphs

0 references

An Optimal Algorithm for Checking Regularity

0 references

On universality of graphs with uniformly distributed edges

0 references

Threshold Functions for Ramsey Properties

0 references

Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs

0 references

Q3768936

0 references

Q3825110

0 references

full work available at URL

https://doi.org/10.1007/bf02787543

0 references

Identifiers

zbMATH Open document ID

1055.05138

0 references

DOI

10.1007/BF02787543

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1885587

@@ Property / author @@
-Vojtěch Rödl
@@ Property / author: Vojtěch Rödl / rank @@
-Normal rank
@@ Property / author @@
-Papa Amar Sissokho
@@ Property / author: Papa Amar Sissokho / rank @@
-Normal rank
@@ Property / author @@
+Vojtěch Rödl
@@ Property / author: Vojtěch Rödl / rank @@
+Normal rank
@@ Property / author @@
+Papa Amar Sissokho
@@ Property / author: Papa Amar Sissokho / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q105583410
@@ Property / Wikidata QID: Q105583410 / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and expanders
@@ Property / cites work: Eigenvalues and expanders / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
+Normal rank
@@ Property / cites work @@
+Explicit Ramsey graphs and orthonormal labelings
@@ Property / cites work: Explicit Ramsey graphs and orthonormal labelings / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit construction of linear sized tolerant networks
+Normal rank
@@ Property / cites work @@
+The Algorithmic Aspects of the Regularity Lemma
@@ Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-random tournaments
@@ Property / cites work: Quasi-random tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse quasi-random graphs
@@ Property / cites work: Sparse quasi-random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-random graphs
@@ Property / cites work: Quasi-random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
+Normal rank
@@ Property / cites work @@
+The number of submatrices of a given type in a Hadamard matrix and related results
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+Szemerédi’s Regularity Lemma for Sparse Graphs
@@ Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Regular pairs in sparse random graphs I
@@ Property / cites work: Regular pairs in sparse random graphs I / rank @@
+Normal rank
@@ Property / cites work @@
+The Turn Theorem for Random Graphs
@@ Property / cites work: The Turn Theorem for Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Checking Regularity
@@ Property / cites work: An Optimal Algorithm for Checking Regularity / rank @@
+Normal rank
@@ Property / cites work @@
+On universality of graphs with uniformly distributed edges
+Normal rank
@@ Property / cites work @@
+Threshold Functions for Ramsey Properties
@@ Property / cites work: Threshold Functions for Ramsey Properties / rank @@
+Normal rank
@@ Property / cites work @@
+Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
+Normal rank
@@ Property / cites work @@
+Q3768936
@@ Property / cites work: Q3768936 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3825110
@@ Property / cites work: Q3825110 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02787543
+Normal rank
@@ Property / OpenAlex ID @@
+W2062632642
@@ Property / OpenAlex ID: W2062632642 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1885587