scientific article; zbMATH DE number 3722680

MaRDI QIDQ3912822zbMATH OpenFDO

Authors László Lovász

Publication date 1979

zbMATH Keywords

graph colouringhypergraph colouringtopological methods

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Cited in

(15)

• A solution of Chartrand's problem on spanning trees
• Homotopy properties of greedoids
• On connectivity of triangulations of manifolds
• A domain monotonicity theorem for graphs and Hamiltonicity
• Design type problems motivated by database theory
• New type of coding problem motivated by database theory
• A generalization of the Bollobás set pairs inequality
• Bollobás-type theorems for hemi-bundled two families
• Some new bounds on partition critical hypergraphs
• Problems and results on 1-cross-intersecting set pair systems
• Some new Bollobás-type inequalities
• Laplace eigenvalues of graphs---a survey
• On Bollobás-type theorems of d-tuples
• Geometrical solution of an intersection problem for two hypergraphs
• Bicolored graph partitioning, or: gerrymandering at its worst

This page was built for publication:

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