The following pages link to (Q5808059):
Displaying 50 items.
- The quest for a characterization of hom-properties of finite character (Q274710) (← links)
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- On the chromatic numbers of integer and rational lattices (Q289743) (← links)
- Chromatic numbers of graphs -- large gaps (Q313434) (← links)
- Universal \(H\)-colourable graphs (Q367065) (← links)
- Dangerous reference graphs and semantic paradoxes (Q380999) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- On the chromatic number of \(\mathbb R^4\) (Q464746) (← links)
- Hedetniemi's conjecture for uncountable graphs (Q509108) (← links)
- Axiom of choice and chromatic number: Examples on the plane (Q598462) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Bounding the distinguishing number of infinite graphs and permutation groups (Q743653) (← links)
- Images of rigid digraphs (Q751667) (← links)
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489) (← links)
- On rigid circuit graphs (Q773621) (← links)
- A contraction theorem for abstract graphs (Q775815) (← links)
- On function algebras in which every congruence is determined by a filter (Q807656) (← links)
- On Rado's boundedness conjecture (Q817614) (← links)
- On embedding of finite distance graphs with large chromatic number in random graphs (Q847934) (← links)
- Some generalizations of theorems on vertex coloring (Q855855) (← links)
- Colouring prime distance graphs (Q912118) (← links)
- Problems related to a de Bruijn-Erdös theorem (Q943846) (← links)
- Colorings of spaces, and random graphs (Q950800) (← links)
- Products of unit distance graphs (Q973156) (← links)
- An index theory for uniformly locally finite graphs (Q1019627) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- Extremal problems concerning transformations of the set of edges of the complete graph (Q1088678) (← links)
- Coloring of commutative rings (Q1108326) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
- The realization of distances in measurable subsets covering \(R^ n\). (Q1156808) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
- Connectivity of distance graphs (Q1196753) (← links)
- Erdős and Rényi conjecture (Q1268624) (← links)
- All unit-distance graphs of order 6197 are 6-colorable (Q1272487) (← links)
- The use of elementary substructures in combinatorics (Q1344620) (← links)
- Two remarks on the coloring number (Q1362106) (← links)
- A generalisation of a theorem of de Bruijn and Erdős on the chromatic numbers of infinite graphs (Q1393406) (← links)
- Chromatic numbers of subgraphs (Q1394356) (← links)
- Axiom of choice and chromatic number of the plane (Q1406751) (← links)
- A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree (Q1660283) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- Axiom of choice and chromatic number of \(R^n\) (Q1775552) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- Additive \(k\)-colorable extensions of the rational plane (Q1813726) (← links)
- Bounds on the measurable chromatic number of \({\mathbb{R}}\) (Q1824627) (← links)
- Variations on a game (Q1836601) (← links)
