Pseudo-random graphs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Vertex percolation on expander graphs
- Matchings in regular graphs from eigenvalues
- Random regular graphs of non-constant degree: concentration of the chromatic number
- More spectral bounds on the clique and independence numbers
- Eigenvalues and edge-connectivity of regular graphs
- The number of Hamiltonian decompositions of regular graphs
- Diameters of random distance graphs
- On the maximum density of fixed strongly connected subtournaments
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Near-perfect clique-factors in sparse pseudorandom graphs
- Hamilton cycles in random subgraphs of pseudo-random graphs
- Bounds for graph regularity and removal lemmas
- Linear dependence between hereditary quasirandomness conditions
- Dense induced bipartite subgraphs in triangle-free graphs
- The normalized matching property in random and pseudorandom bipartite graphs
- Tournament quasirandomness from local counting
- Recent progress in combinatorial random matrix theory
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- On explicit random-like tournaments
- Spectral conditions for graph rigidity in the Euclidean plane
- Regular Turán numbers of complete bipartite graphs
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Ramsey numbers involving an odd cycle and large complete graphs in three colors
- Spectrum of Johnson graphs
- Approximately strongly regular graphs
- On the zero forcing number and spectral radius of graphs
- Hamiltonicity in cherry-quasirandom 3-graphs
- Eigenvalues of Cayley graphs
- A clique-free pseudorandom subgraph of the pseudo polarity graph
- Pseudorandom processes
- A point-sphere incidence bound in odd dimensions and applications
- The second largest eigenvalue and vertex-connectivity of regular multigraphs
- Orthonormal representations of \(H\)-free graphs
- A construction for clique-free pseudorandom graphs
- Toughness in pseudo-random graphs
- Explicit expanders of every degree and size
- Clique-factors in sparse pseudorandom graphs
- Synchronization of coupled chaotic maps
- Additive approximation for edge-deletion problems
- Counting results for sparse pseudorandom hypergraphs. II.
- On resilience of connectivity in the evolution of random graphs
- On a conjecture of Erdős and Simonovits: even cycles
- Extremal results in sparse pseudorandom graphs
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- Additive patterns in multiplicative subgroups
- Quasi-random multilinear polynomials
- Poisson approximation for non-backtracking random walks
- Discrepancies of spanning trees and Hamilton cycles
- Sharp spectral bounds for the vertex-connectivity of regular graphs
- Graph toughness from Laplacian eigenvalues
- Sharp spectral bounds for the edge-connectivity of regular graphs
- Maximizing the order of a regular graph of given valency and second eigenvalue
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Discrepancy and eigenvalues of Cayley graphs
- Distance graphs in vector spaces over finite fields
- Small complete minors above the extremal edge density
- Pseudo-random properties of self-complementary symmetric graphs
- Online Ramsey numbers and the subgraph query problem
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- The Kőnig graph process
- On the solvability of systems of bilinear equations in finite fields
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- On two problems in graph Ramsey theory
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- Randomised broadcasting: memory vs. randomness
- Random walks on quasirandom graphs
- Turán numbers of bipartite graphs plus an odd cycle
- Regular factors and eigenvalues of regular graphs
- Extremal edge polytopes
- On the number of Hamilton cycles in pseudo-random graphs
- Ramsey properties of random subgraphs of pseudo-random graphs
- Hereditary quasirandomness without regularity
- Constructing cospectral graphs via a new form of graph product
- Finding and using expanders in locally sparse graphs
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- The Zero Forcing Number of Graphs
- Hamilton cycles in dense vertex-transitive graphs
- Forcing quasirandomness with triangles
- Quasirandom Cayley graphs
- Spectral bounds for the connectivity of regular graphs with given order
- Sparse pseudo‐random graphs are Hamiltonian
- 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
- Entropy samplers and strong generic lower bounds for space bounded learning
- Spectral analysis of matrix scaling and operator scaling
- Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs
- Spectral bounds for the \(k\)-independence number of a graph
- scientific article; zbMATH DE number 7478535 (Why is no real title available?)
- Ramsey properties of algebraic graphs and hypergraphs
- Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- Small subgraphs in the trace of a random walk
- Pseudorandom Graphs in Data Structures
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
This page was built for publication: Pseudo-random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477817)
