Sketchy tweets: ten minute conjectures in graph theory

DOI10.1007/S00283-012-9275-2MaRDI QIDQ2429454zbMATH OpenOpenAlexWikidataFDO

Authors R. J. Nowakowski, Anthony Bonato

Publication date 27 April 2012

Published in The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00283-012-9275-2

zbMATH Keywords

tutorial

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (educational aspects) (97K30)

Cites work

• \(E_{11}\) and M theory
• A congruence theorem for trees
• A Contribution to the Theory of Chromatic Polynomials
• A dynamic survey of graph labeling
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A survey on Hedetniemi's conjecture
• An upper bound for some ramsey numbers
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Asymptotically settling Zarankiewicz's conjecture in finite time, for each m
• Cops and robbers in graphs with large girth and Cayley graphs
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Every planar map is four colorable. II: Reducibility
• Flows and generalized coloring theorems in graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Hedetniemi's conjecture---a survey
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3937197 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Nowhere-zero 6-flows
• On a problem of P. Turan concerning graphs
• Open problems of Paul Erd�s in graph theory
• Polyhedral decompositions of cubic graphs
• Ramsey's theorem - a new lower bound
• Some remarks on the theory of graphs
• The crossing number of K5,n
• The early history of the brick factory problem
• The game of cops and robbers on graphs
• Tutte's 5-flow conjecture for the projective plane
• Vizing's conjecture: a survey and recent results

Cited in

(2)

• A tight upper bound on the average order of dominating sets of a graph
• Cubic graphs having only k-cycles in each 2-factor

This page was built for publication: Sketchy tweets: ten minute conjectures in graph theory

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