On a result of Thomassen

DOI10.1090/PROC/12990MaRDI QIDQ2809211zbMATH OpenOpenAlexFDO

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

Recommendations

• On a construction of Thomassen
• On a conjecture of Thomassen
• An improvement of a recent result of Thomson
• On a Result of Bruns
• On Thompson's theorem
• Sur un résultat de Waldspurger
• On a result of N. Terglane
• scientific article; zbMATH DE number 1789806
• On the Thomas equation
• On a result of Birkhoff

Cites work

• scientific article; zbMATH DE number 3508503 (Why is no real title available?)
• scientific article; zbMATH DE number 1388192 (Why is no real title available?)
• scientific article; zbMATH DE number 3075904 (Why is no real title available?)
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Infinitely connected subgraphs in graphs of uncountable chromatic number

Cited in

(6)

• On the connectivity of infinite graphs
• scientific article; zbMATH DE number 2147152 (Why is no real title available?)
• Axel Thue in context
• scientific article; zbMATH DE number 1054698 (Why is no real title available?)
• Orientations of graphs with uncountable chromatic number
• Infinitely connected subgraphs in graphs of uncountable chromatic number

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)