scientific article; zbMATH DE number 4099367
From MaRDI portal
Publication:3825110
Recommendations
- Random strongly regular graphs?
- scientific article; zbMATH DE number 1161245
- Random graphs and their subgraphs
- scientific article; zbMATH DE number 845673
- Pseudo-random graphs
- scientific article; zbMATH DE number 4027516
- scientific article; zbMATH DE number 18981
- Random regular graphs of high degree
- scientific article; zbMATH DE number 3869382
Cited in
(84)- Random constructions and density results
- Quasi-randomness and the distribution of copies of a fixed graph
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- On testing the `pseudo-randomness' of a hypergraph
- On the density of subgraphs in a graph with bounded independence number
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Finitely forcible graph limits are universal
- Extremal graph theory and finite forcibility
- Pseudo-random hypergraphs
- Hermitian matrices and graphs: Singular values and discrepancy
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Tournament quasirandomness from local counting
- No additional tournaments are quasirandom-forcing
- Approximately strongly regular graphs
- Hamiltonicity in cherry-quasirandom 3-graphs
- A clique-free pseudorandom subgraph of the pseudo polarity graph
- Toughness in pseudo-random graphs
- More on quasi-random graphs, subgraph counts and graph limits
- Clique-factors in sparse pseudorandom graphs
- Compactness and finite forcibility of graphons
- Counting results for sparse pseudorandom hypergraphs. I.
- Counting results for sparse pseudorandom hypergraphs. II.
- Extremal results in sparse pseudorandom graphs
- A hierarchy of randomness for graphs
- Dense expanders and pseudo-random bipartite graphs
- Perfect packings in quasirandom hypergraphs. I.
- A characterization of functions with vanishing averages over products of disjoint sets
- Quasi-random oriented graphs
- Random Latin square graphs
- Quasi-randomness of graph balanced cut properties
- Pseudo-random properties of self-complementary symmetric graphs
- Embedding tetrahedra into quasirandom hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- Hereditary quasirandomness without regularity
- Weak regularity and finitely forcible graph limits
- Forcing quasirandomness with triangles
- Quasirandom Cayley graphs
- scientific article; zbMATH DE number 2149410 (Why is no real title available?)
- Quasi-Random Set Systems
- Finitely forcible graphons and permutons
- Extremal results for odd cycles in sparse pseudorandom graphs
- Extrema of graph eigenvalues
- A proof of Brouwer's toughness conjecture
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- scientific article; zbMATH DE number 7478535 (Why is no real title available?)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
- Quasi-random graphs, pseudo-random graphs and pseudorandom binary sequences. I: Quasi-random graphs
- Pseudorandom Graphs in Data Structures
- Popular progression differences in vector spaces II
- Optimal bounds for single-source Kolmogorov extractors
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Perfect Packings in Quasirandom Hypergraphs II
- One-dimensional asymptotic classes of finite structures
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Quasi-random graphs
- Random strongly 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
- Quasirandom-Forcing Orientations of Cycles
- Covering cycles in sparse graphs
- A unified view of graph regularity via matrix decompositions
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- scientific article; zbMATH DE number 7731163 (Why is no real title available?)
- Restricted problems in extremal combinatorics
- Quasi-random graphs and graph limits
- More non-bipartite forcing pairs
- Forcing generalised quasirandom graphs efficiently
- A unified combinatorial view beyond some spectral properties
- Hamiltonicity of sparse pseudorandom graphs
- The Hamiltonicity of quasi-random k-graphs
- Turán problems in pseudorandom graphs
- Rigid partitions: from high connectivity to random graphs
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- Clique factors in pseudorandom graphs
- f-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials
- Forcing quasirandomness in a regular tournament
- Subgraphs of the projective norm graph
- Turán's theorem for pseudo-random graphs
- The Grothendieck constant of random and pseudo-random graphs
- Weak hypergraph regularity and linear hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825110)
