A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
From MaRDI portal
(Redirected from Publication:5886111)
Recommendations
- An undecidability result on limits of sparse graphs
- On ultralimits of sparse graph classes
- On limits of sparse random graphs
- On Brooks' Theorem for Sparse Graphs
- Sparse graph limits along balls
- On Turan's theorem for sparse graphs
- A counter-example to ‘Wagner's conjecture’ for infinite graphs
- The 1,2,3-conjecture and 1,2-conjecture for sparse graphs
- A conjecture concerning a limit of non-Cayley graphs
Cites work
- A relative Szemerédi theorem
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Extremal results in sparse pseudorandom graphs
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- Large networks and graph limits
- Metrics for sparse graphs
- Quasi-random graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- The Green-Tao theorem: an exposition
- The primes contain arbitrarily long arithmetic progressions
Cited in
(3)
This page was built for publication: A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886111)
