On universality of graphs with uniformly distributed edges
From MaRDI portal
Publication:1089355
DOI10.1016/0012-365X(86)90076-2zbMath0619.05035OpenAlexW1984080039WikidataQ105583518 ScholiaQ105583518MaRDI QIDQ1089355
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)
Related Items
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Large triangle-free subgraphs in graphs without \(K_ 4\), A problem of Erdős and Sós on 3-graphs, Lower bound on the size of a quasirandom forcing set of permutations, Finitely forcible graph limits are universal, Embedding graphs with bounded degree in sparse pseudorandom graphs, Strong edge colorings of uniform graphs, Quasi-Random Set Systems, Quasirandom permutations are characterized by 4-point densities, Quasi-random multilinear polynomials, A counting lemma for sparse pseudorandom hypergraphs, Embedding tetrahedra into quasirandom hypergraphs, Small subsets inherit sparse \(\varepsilon\)-regularity, The number of submatrices of a given type in a Hadamard matrix and related results, Some Ramsey-Turán type results for hypergraphs, Counting results for sparse pseudorandom hypergraphs. I., Counting results for sparse pseudorandom hypergraphs. II., The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Excluding hooks and their complements, Note on upper density of quasi-random hypergraphs, Pure pairs. IV: Trees in bipartite graphs, Strengthening Rödl's theorem, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Quasirandom-Forcing Orientations of Cycles, Extremal problems in uniformly dense hypergraphs, Erdős–Hajnal for graphs with no 5‐hole, Quasirandom Latin squares, Pure pairs. X. Tournaments and the strong Erdős-Hajnal property, Caterpillars in Erdős-Hajnal, The codegree threshold of \(K_4^-\), Uniform Turán density of cycles, A further extension of Rödl's theorem, Pure Pairs. IX. Transversal Trees, Restricted problems in extremal combinatorics, Pure pairs. I: Trees and linear anticomplete pairs, Two Erdős-Hajnal-type theorems in hypergraphs, Finitely forcible graphons and permutons, FORCING QUASIRANDOMNESS WITH TRIANGLES, Quasi-random graphs, Erdős-Hajnal-type results for monotone paths, Erdős-Hajnal for cap-free graphs, Quasi-random subsets of \(\mathbb{Z}_ n\), On testing the `pseudo-randomness' of a hypergraph, Induced Ramsey-type theorems, Induced Ramsey-type theorems, Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, Weak hypergraph regularity and linear hypergraphs, Regular pairs in sparse random graphs I, Quasirandomness in hypergraphs, Quasi-random words and limits of word sequences, Pure pairs. II: Excluding all subdivisions of a graph, The Erdös--Hajnal Conjecture for Long Holes and Antiholes, Characterization of quasirandom permutations by a pattern sum, Discrepancy and eigenvalues of Cayley graphs, The number of graphs without forbidden subgraphs, Weak regularity and finitely forcible graph limits, Ordered graphs and large bi-cliques in intersection graphs of curves, Quasirandomness in hypergraphs, Large Homogeneous Submatrices, The Erdős-Hajnal conjecture for paths and antipaths, No additional tournaments are quasirandom-forcing, Pure Pairs VI: Excluding an Ordered Tree
Cites Work
