A characterization for sparse -regular pairs

MaRDI QIDQ870053zbMATH OpenFDO

Authors Stefanie Gerke, Angelika Steger

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, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r4.html

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

zbMATH Keywords

regularity lemma

Mathematics Subject Classification ID

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

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

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)