scientific article; zbMATH DE number 3308988

zbMATH Open0194.25102MaRDI QIDQ5589869FDOQ5589869

P. Erdős

Publication date: 1969

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Problem books (00A07)

Cited In (21)

• SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
• Some colouring problems for Paley graphs
• \(C_4\)-free subgraphs with large average degree
• Title not available (Why is that?)
• Lower bounds for some Ramsey numbers
• Hadwiger's conjecture for graphs on the Klein bottle
• Title not available (Why is that?)
• Inverse chromatic number problems in interval and permutation graphs
• Chromatic graphs, Ramsey numbers and the flexible atom conjecture
• Some Conjectures and Questions in Chromatic Topological Graph Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs of large chromatic number
• The χt-coloring problem
• Subgraphs of Kneser graphs with large girth and large chromatic number
• Triangle-free subgraphs with large fractional chromatic number
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• A note on Thomassen's conjecture
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• From combinatorial problems to graph colorings

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On circuits and subgraphs of chromatic graphs 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q5589869)