The maximum number of edges in a graph of bounded dimension, with applications to ring theory

DOI10.1016/S0012-365X(98)00309-4zbMath0936.05061MaRDI QIDQ1301725

Geir Agnarsson, Stefan Felsner, William T. jun. Trotter

Publication date: 18 May 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

dimensionregularity lemmapartially ordered setRamsey theoremBetti numbersextremal graph theoryfinite graphincidence poset

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

Separation dimension of graphs and hypergraphs ⋮ Dimension of CPT posets ⋮ Orthogonal surfaces and their CP-orders ⋮ Incidence posets and cover graphs ⋮ Dimension preserving contractions and a finite list of 3-irreducible posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs and poset dimension
• The order dimension of the complete graph
• The dimension of two levels of the Boolean lattice
• Gröbner bases and primary decomposition in polynomial rings in one variable over Dedekind domains
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Lectures on Polytopes
• Minimal scrambling sets of simple orders
• On the structure of linear graphs

This page was built for publication: The maximum number of edges in a graph of bounded dimension, with applications to ring theory