On a result of Thomassen

DOI10.1090/PROC/12990zbMATH Open1390.03042OpenAlexW2346339199MaRDI QIDQ2809211FDOQ2809211

Péter Komjáth

Publication date: 27 May 2016

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/proc/12990

zbMATH Keywords

graphchromatic numbersubgraphedge-connectivityoutdegree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Cites Work

• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Infinitely connected subgraphs in graphs of uncountable chromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Axel Thue in context
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• On a construction of Thomassen 👍 👎
• On Thompson's theorem 👍 👎
• On a conjecture of Thomassen 👍 👎
• On a Result of Bruns 👍 👎
• Sur un résultat de Waldspurger 👍 👎
• On a result of Birkhoff 👍 👎
• On the Thomas equation 👍 👎
• An improvement of a recent result of Thomson 👍 👎
• On a Result of N. Terglane 👍 👎

This page was built for publication: On a result of Thomassen

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