A characterization for sparse -regular pairs

zbMATH Open1112.05089MaRDI QIDQ870053FDOQ870053

Angelika Steger, Stefanie Gerke

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127342

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Regular pairs in sparse random graphs I
• Matrix-free proof of a regularity characterization
• Holes in graphs
• scientific article; zbMATH DE number 1944144
• Small subsets inherit sparse \(\varepsilon\)-regularity

zbMATH Keywords

regularity lemma

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75)

Cited In (5)

• Holes in graphs
• Grothendieck-type inequalities in combinatorial optimization
• Regular pairs in sparse random graphs I
• Matrix-free proof of a regularity characterization
• Small subsets inherit sparse \(\varepsilon\)-regularity

This page was built for publication: A characterization for sparse \(\varepsilon\)-regular pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870053)