Note on forcing pairs

MaRDI QIDQ2857384zbMATH OpenFDO

Authors Hiệp Hàn, Yury Person, M. Schacht

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001405

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Forcing quasirandomness with triangles
• No additional tournaments are quasirandom-forcing
• Lower bound on the size of a quasirandom forcing set of permutations
• Finitely forcible graphons
• Quasi-randomness and the distribution of copies of a fixed graph

Cited in

(5)

• Weak quasi-randomness for uniform hypergraphs
• Forcing quasirandomness with triangles
• Quasirandom graphs and the pantograph equation
• Lower bound on the size of a quasirandom forcing set of permutations
• More non-bipartite forcing pairs

This page was built for publication: Note on forcing pairs

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