scientific article; zbMATH DE number 5037081
From MaRDI portal
Publication:5477817
zbMath1098.05075MaRDI QIDQ5477817
Michael Krivelevich, Benjamin Sudakov
Publication date: 29 June 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamiltonianindependence numberconnectivitychromatic numbermatchingsgraph eigenvaluesspectral graph theory
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (only showing first 100 items - show all)
On the zero forcing number and spectral radius of graphs ⋮ Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ Eigenvalues of Cayley graphs ⋮ A clique-free pseudorandom subgraph of the pseudo polarity graph ⋮ Quasi-random multilinear polynomials ⋮ Small complete minors above the extremal edge density ⋮ Pseudorandom processes ⋮ A point-sphere incidence bound in odd dimensions and applications ⋮ Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ Additive approximation for edge-deletion problems ⋮ Poisson approximation for non-backtracking random walks ⋮ Large matchings from eigenvalues ⋮ Counting results for sparse pseudorandom hypergraphs. II. ⋮ Bart--Moe games, JumbleG and discrepancy ⋮ Hereditary quasirandomness without regularity ⋮ On the density of a graph and its blowup ⋮ On two problems in graph Ramsey theory ⋮ Turán's theorem for pseudo-random graphs ⋮ Constructing cospectral graphs via a new form of graph product ⋮ Small subgraphs of random regular graphs ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ The second largest eigenvalue and vertex-connectivity of regular multigraphs ⋮ Randomised broadcasting: memory vs. randomness ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Bounds for graph regularity and removal lemmas ⋮ An approximate version of Sidorenko's conjecture ⋮ Random walks on quasirandom graphs ⋮ The number of Hamiltonian decompositions of regular graphs ⋮ Turán numbers of bipartite graphs plus an odd cycle ⋮ Unnamed Item ⋮ Diameters of random distance graphs ⋮ Regular factors and eigenvalues of regular graphs ⋮ Extremal edge polytopes ⋮ Stability of twisted states in the Kuramoto model on Cayley and random graphs ⋮ Sharp spectral bounds for the vertex-connectivity of regular graphs ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ The phase transition in site percolation on pseudo-random graphs ⋮ Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation ⋮ Orthonormal representations of \(H\)-free graphs ⋮ The Zero Forcing Number of Graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ Sharp spectral bounds for the edge-connectivity of regular graphs ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Extremal results in sparse pseudorandom graphs ⋮ A construction for clique-free pseudorandom graphs ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets ⋮ Mixing time of exponential random graphs ⋮ Toughness in pseudo-random graphs ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Extrema of graph eigenvalues ⋮ Explicit expanders of every degree and size ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ On eigenvalues of random complexes ⋮ Quasirandom Cayley graphs ⋮ Small subgraphs in the trace of a random walk ⋮ Powers of Hamilton cycles in pseudorandom graphs ⋮ Linear dependence between hereditary quasirandomness conditions ⋮ Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ A randomized embedding algorithm for trees ⋮ On packing Hamilton cycles in \(\varepsilon\)-regular graphs ⋮ The effect of induced subgraphs on quasi-randomness ⋮ Additive patterns in multiplicative subgroups ⋮ The normalized matching property in random and pseudorandom bipartite graphs ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ Tournament quasirandomness from local counting ⋮ Recent progress in combinatorial random matrix theory ⋮ Vertex percolation on expander graphs ⋮ Matchings in regular graphs from eigenvalues ⋮ 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 ⋮ The Kőnig graph process ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue ⋮ On the solvability of systems of bilinear equations in finite fields ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ Discrepancy and eigenvalues of Cayley graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Bandwidth theorem for random graphs ⋮ On a conjecture of Brouwer involving the connectivity of strongly regular graphs ⋮ A Proof of Brouwer's Toughness Conjecture ⋮ Clique-factors in sparse pseudorandom graphs ⋮ Distance Graphs in Vector Spaces Over Finite Fields ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ 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 ⋮ Ramsey numbers involving an odd cycle and large complete graphs in three colors ⋮ Spectrum of Johnson graphs ⋮ Approximately strongly regular graphs ⋮ Synchronization of coupled chaotic maps
This page was built for publication:
