Extensions of extremal graph theory to grids

MaRDI QIDQ2968052zbMATH OpenFDO

Authors Bret Thacher

Publication date 9 March 2017

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• The Turán number of the grid
• Combinational numerical methods with minimum discretization error
• scientific article; zbMATH DE number 3970790
• Turan's Graph Theorem
• scientific article; zbMATH DE number 1990667

Cited in

(9)

• Gridline graphs: A review in two dimensions and an extension to higher dimensions
• The grid theorem for vertex-minors
• A survey of grid diagrams and a proof of Alexander's theorem
• scientific article; zbMATH DE number 493050 (Why is no real title available?)
• Combinational numerical methods with minimum discretization error
• scientific article; zbMATH DE number 7055496 (Why is no real title available?)
• An extremal graph problem on a grid and an isoperimetric problem for polyominoes
• The Turán number of the grid
• Graphs in which the neighborhoods of all vertices are clique extensions of grids

This page was built for publication: Extensions of extremal graph theory to grids

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