Pages that link to "Item:Q2274002"
From MaRDI portal
The following pages link to Counterexamples to Hedetniemi's conjecture (Q2274002):
Displaying 50 items.
- Square-free graphs are multiplicative (Q345100) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← links)
- Hastings's additivity counterexample via Dvoretzky's theorem (Q634619) (← links)
- A counter-example to the theorem of Hiemer and Snurnikov (Q702944) (← links)
- On counterexamples to the Hughes conjecture. (Q731246) (← links)
- A note on the Poljak-Rödl function (Q782938) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Thinness of product graphs (Q831864) (← links)
- Hájek's theorem does not hold for \(n>1\) (Q1065185) (← links)
- Heinrich's counterexample to Azevedo's conjecture (Q1344389) (← links)
- Counterexamples to Knaster's conjecture (Q1378002) (← links)
- A survey on Hedetniemi's conjecture (Q1387740) (← links)
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi (Q1567683) (← links)
- On Hedetniemi's conjecture and the colour template scheme (Q1613520) (← links)
- Altermatic number of categorical product of graphs (Q1709531) (← links)
- Counterexamples to Jaeger's circular flow conjecture (Q1748263) (← links)
- Note on Hedetniemi's conjecture and the Poljak-Rödl function (Q2058954) (← links)
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers (Q2084794) (← links)
- On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle (Q2132214) (← links)
- The fractional chromatic number of generalized cones over graphs (Q2138562) (← links)
- The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188) (← links)
- Relatively small counterexamples to Hedetniemi's conjecture (Q2221923) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← links)
- A complexity problem for Borel graphs (Q2238048) (← links)
- A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function (Q2278108) (← links)
- Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs (Q2332386) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Counterexamples to witness conjectures (Q2457379) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs (Q2673495) (← links)
- Hedetniemi's conjecture from the topological viewpoint (Q2680825) (← links)
- On total coloring the direct product of cycles and bipartite direct product of graphs (Q2699911) (← links)
- Strongly Projective Graphs (Q3153537) (← links)
- Search for good examples of Hall’s conjecture (Q3177724) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- Counterexamples to a Conjecture of Harris on Hall Ratio (Q5093587) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Minimal definable graphs of definable chromatic number at least three (Q5149654) (← links)
- Quantum multiplicative graph and a type of separate clique number (Q5153784) (← links)
- The diameter of strong orientations of strong products of graphs (Q5163023) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- Counterexamples to Okounkov’s log-concavity conjecture (Q5434675) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices (Q5878469) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Distance formula for direct-co-direct product in the case of disconnected factors (Q5888905) (← links)
- Explicit examples to the H-problem of Heinz Hopf (Q5899790) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
- On some metric properties of direct-co-direct product (Q6096252) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)
