scientific article
From MaRDI portal
zbMath0632.05045MaRDI QIDQ3768936
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Hamiltonicity in cherry-quasirandom 3-graphs, An approximate version of the tree packing conjecture, Perfect packings in quasirandom hypergraphs. I., Popular progression differences in vector spaces II, Hermitian matrices and graphs: Singular values and discrepancy, A counterexample to the Bollobás–Riordan conjectures on sparse graph limits, Scaling of weighted spectral distribution in deterministic scale-free networks, Lower bound on the size of a quasirandom forcing set of permutations, Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, Finitely forcible graph limits are universal, A characterization of functions with vanishing averages over products of disjoint sets, Embedding graphs with bounded degree in sparse pseudorandom graphs, Intersections of graphs, The step Sidorenko property and non-norming edge-transitive graphs, A clique-free pseudorandom subgraph of the pseudo polarity graph, Quasirandom permutations are characterized by 4-point densities, Quasi-random multilinear polynomials, Generalizations of Fourier analysis, and how to apply them, Embedding tetrahedra into quasirandom hypergraphs, Dense expanders and pseudo-random bipartite graphs, Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs, Complete Minors in Graphs Without Sparse Cuts, Limits of dense graph sequences, Counting results for sparse pseudorandom hypergraphs. I., Counting results for sparse pseudorandom hypergraphs. II., Bart--Moe games, JumbleG and discrepancy, Hereditary quasirandomness without regularity, Turán's theorem for pseudo-random graphs, Diagonal Ramsey via effective quasirandomness, Concentration estimates for functions of finite high‐dimensional random arrays, Quasirandom-Forcing Orientations of Cycles, On some graph densities in locally dense graphs, Covering cycles in sparse graphs, A unified view of graph regularity via matrix decompositions, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, 1‐independent percolation on ℤ2×Kn, Natural quasirandomness properties, Quasirandom Latin squares, On the extremal function for graph minors, Extremal graph theory and finite forcibility, Extremal results on feedback arc sets in digraphs, Restricted problems in extremal combinatorics, Local-vs-global combinatorics, Matrix and discrepancy view of generalized random and quasirandom graphs, Perfect Packings in Quasirandom Hypergraphs II, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, Finitely forcible graphons with an almost arbitrary structure, Quasi-random graphs and graph limits, Extremal results in sparse pseudorandom graphs, Semantic limits of dense combinatorial objects, Toughness in pseudo-random graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, FORCING QUASIRANDOMNESS WITH TRIANGLES, Optimal covers with Hamilton cycles in random graphs, On the maximum density of fixed strongly connected subtournaments, Extrema of graph eigenvalues, Generalized quasirandom graphs, Quasirandom Cayley graphs, Quasi-random subsets of \(\mathbb{Z}_ n\), Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, On testing the `pseudo-randomness' of a hypergraph, Linear dependence between hereditary quasirandomness conditions, 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, Discrepancy minimizing spectral clustering, More on quasi-random graphs, subgraph counts and graph limits, Weak hypergraph regularity and linear hypergraphs, Random strongly regular graphs?, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, Quasirandomness in hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, The normalized matching property in random and pseudorandom bipartite graphs, A new upper bound for diagonal Ramsey numbers, Tournament quasirandomness from local counting, Quasi-random words and limits of word sequences, Complexity and randomness in the Heisenberg groups (and beyond), Generalized quasirandom properties of expanding graph sequences, Triangle‐factors in pseudorandom graphs, Optimal bounds for single-source Kolmogorov extractors, Characterization of quasirandom permutations by a pattern sum, Pseudo-random hypergraphs, Multigraph limits, unbounded kernels, and Banach space decorated graphs, A simple linear expected time algorithm for finding a Hamilton path, The order of the largest complete minor in a random graph, A Proof of Brouwer's Toughness Conjecture, Weak regularity and finitely forcible graph limits, Clique-factors in sparse pseudorandom graphs, A note on random k-dimensional posets, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, The quasi-randomness of hypergraph cut properties, Hereditary quasi-random properties of hypergraphs, Edge-disjoint Hamilton cycles in random graphs, Ramsey numbers of books and quasirandomness, The extremal function for complete minors, No additional tournaments are quasirandom-forcing, On the Density of Transitive Tournaments, Relating multiway discrepancy and singular values of nonnegative rectangular matrices, Two remarks on graph norms, Wavelength routing in optical networks of diameter two
