On universality of graphs with uniformly distributed edges
From MaRDI portal
Publication:1089355
DOI10.1016/0012-365X(86)90076-2zbMATH Open0619.05035OpenAlexW1984080039WikidataQ105583518 ScholiaQ105583518MaRDI QIDQ1089355FDOQ1089355
Authors: Vojtěch Rödl 
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90076-2
Recommendations
Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (91)
- Which subsets of an infinite random graph look random?
- A further extension of Rödl's theorem
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
- Hypergraphs with minimum positive uniform Turán density
- Erdős–Hajnal for graphs with no 5‐hole
- A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion
- Pure Pairs. IX. Transversal Trees
- Asymptotically optimal induced decompositions
- Restricted problems in extremal combinatorics
- Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
- Universality of graphs with few triangles and anti-triangles
- Forcing generalised quasirandom graphs efficiently
- Pure pairs. IV: Trees in bipartite graphs
- Forcing quasirandomness with triangles
- Induced subgraph density. II: Sparse and dense sets in cographs
- Strengthening Rödl's theorem
- Title not available (Why is that?)
- Large homogeneous submatrices
- Title not available (Why is that?)
- Pure pairs. II: Excluding all subdivisions of a graph
- No additional tournaments are quasirandom-forcing
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Universal edge scaling in random partitions
- Pure pairs. I: Trees and linear anticomplete pairs
- On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
- Quasi-random words and limits of word sequences
- The number of submatrices of a given type in a Hadamard matrix and related results
- Note on upper density of quasi-random hypergraphs
- Existence of proportional graphs
- Quasi-random graphs
- Characterization of quasirandom permutations by a pattern sum
- An improved upper bound on the density of universal random graphs
- What must be contained in every oriented k-uniform hypergraph
- Edge Distribution of Graphs with Few Copies of a Given Graph
- Quasirandom-Forcing Orientations of Cycles
- Weak hypergraph regularity and linear hypergraphs
- Title not available (Why is that?)
- The Erdős-Hajnal conjecture for paths and antipaths
- Uniform edge distribution in hypergraphs is hereditary
- Some Ramsey-Turán type results for hypergraphs
- Erdős-Hajnal-type results for monotone paths
- Caterpillars in Erdős-Hajnal
- Regular pairs in sparse random graphs I
- Induced universal hypergraphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- A counting lemma for sparse pseudorandom hypergraphs
- Embedding tetrahedra into quasirandom hypergraphs
- Weak regularity and finitely forcible graph limits
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Discrepancy and eigenvalues of Cayley graphs
- Title not available (Why is that?)
- Edge rigidity and universality of random regular graphs of intermediate degree
- The Erdős-Hajnal conjecture for long holes and antiholes
- Universality, tolerance, chaos and order
- Induced Ramsey-type theorems
- Ramsey-type theorems
- Finitely forcible graphons and permutons
- Lower bound on the size of a quasirandom forcing set of permutations
- The number of graphs without forbidden subgraphs
- Quasi-random multilinear polynomials
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- Excluding hooks and their complements
- Optimal threshold for a random graph to be 2-universal
- Uniform Turán density of cycles
- Uniform resource networks. I: Complete graphs
- Nearly uniform distribution of edges amongk-subgraphs of a graph
- A universality theorem for stressable graphs in the plane
- On universal representation of random graphs
- Finitely forcible graph limits are universal
- On testing the `pseudo-randomness' of a hypergraph
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Quasirandom Latin squares
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Universality of Random Graphs for Graphs of Maximum Degree Two
- Induced Ramsey-type theorems
- Two Erdős-Hajnal-type theorems in hypergraphs
- Erdős-Hajnal for cap-free graphs
- Strong edge colorings of uniform graphs
- Quasi-Random Set Systems
- Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\)
- Asymptotically optimal induced universal graphs
- Pure pairs. VI: Excluding an ordered tree
- Extremal problems in uniformly dense hypergraphs
- Quasirandom permutations are characterized by 4-point densities
- Counting results for sparse pseudorandom hypergraphs. I.
- Counting results for sparse pseudorandom hypergraphs. II.
This page was built for publication: On universality of graphs with uniformly distributed edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089355)
