On generalized shift graphs

DOI10.4064/FM226-2-6MaRDI QIDQ5420363zbMATH OpenOpenAlexFDO

Authors Christian Avart, Tomasz Łuczak, Vojtěch Rödl

Publication date 12 June 2014

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/fm226-2-6

zbMATH Keywords

chromatic numberinfinite graphsodd girthshift graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Recommendations

• Shifts in Cayley graphs
• On shift stable hypergraphs
• Algebraic Shifting of Finite Graphs
• Cyclic shift problems on graphs
• On the guessing number of shift graphs
• On generalized Sierpiński graphs
• Threshold graphs, shifted complexes, and graphical complexes
• scientific article; zbMATH DE number 426339
• Generalizing \(D\)-graphs
• On generalized split graphs

Cited in

(10)

• Independent sets in subgraphs of a shift graph
• On the growth rate of chromatic numbers of finite subgraphs
• Finite versus infinite: an insufficient shift
• On directed local chromatic number, shift graphs, and Borsuk-like graphs
• The chromatic number of finite type-graphs
• Shift graphs on precompact families of finite sets of natural numbers
• Infinite stable graphs with large chromatic number
• scientific article; zbMATH DE number 7696896 (Why is no real title available?)
• Hedetniemi's conjecture and adjoint functors in thin categories
• Shift graphs, chromatic number and acyclic one-path orientations

This page was built for publication: On generalized shift graphs

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