The fractional version of Hedetniemi's conjecture is true
From MaRDI portal
Publication:648973
Recommendations
- A fractional version of the Erdős-Faber-Lovász conjecture
- A fractional version of the peano-sard theorem
- The last fraction of a fractional conjecture
- Hedetniemi's conjecture is asymptotically false
- Fractional aspects of the Erdős-Faber-Lovász conjecture
- A COUNTEREXAMPLE TO A CONTINUED FRACTION CONJECTURE
- Rademacher's infinite partial fraction conjecture is (almost certainly) false
- The Friedlander-Gordon-Miller conjecture is true
- An approach to hedetniemi's conjecture
- Multidimensional Hecke theorem on the distribution of fractional parts
Cites work
- scientific article; zbMATH DE number 3728320 (Why is no real title available?)
- scientific article; zbMATH DE number 37867 (Why is no real title available?)
- scientific article; zbMATH DE number 3520447 (Why is no real title available?)
- scientific article; zbMATH DE number 2119454 (Why is no real title available?)
- A survey on Hedetniemi's conjecture
- Chromatic Ramsey numbers
- Circular chromatic number: A survey
- Fractional chromatic numbers of cones over graphs
- Graph products and the chromatic difference sequence of vertex-transitive graphs
- Hedetniemi's conjecture---a survey
- Independent sets in direct products of vertex-transitive graphs
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
- On directed local chromatic number, shift graphs, and Borsuk-like graphs
- On topological relaxations of chromatic conjectures
- Star chromatic numbers and products of graphs
- Star-extremal graphs and the lexicographic product
- The chromatic Ramsey number of odd wheels
- The chromatic number of the product of two 4-chromatic graphs is 4
- The fractional chromatic number of the categorical product of graphs
- The fractional chromatic number of the direct product of graphs
Cited in
(29)- In praise of homomorphisms
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Counterexamples to Hedetniemi's conjecture
- Thinness of product graphs
- Fractional chromatic numbers of tensor products of three graphs
- Hedetniemi's conjecture is asymptotically false
- Degree Ramsey numbers of graphs
- Independent sets in direct products of vertex-transitive graphs
- Orthogonal graphs over finite commutative rings of odd characteristic
- Degree Ramsey numbers for even cycles
- Degree bipartite Ramsey numbers
- Rademacher's infinite partial fraction conjecture is (almost certainly) false
- Symplectic graphs over finite commutative rings
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
- The fractional chromatic number of generalized cones over graphs
- On the ultimate categorical independence ratio
- Turán numbers of several bipartite graphs
- Maximum independent sets in direct products of cycles or trees with arbitrary graphs
- Shannon capacity and the categorical product
- Note on Hedetniemi's conjecture and the Poljak-Rödl function
- Independent sets in tensor products of three vertex-transitive graphs
- Sabidussi versus Hedetniemi for three variations of the chromatic number
- Relatively small counterexamples to Hedetniemi's conjecture
- Vector coloring the categorical product of graphs
- A note on the Poljak-Rödl function
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers
- A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
- Altermatic number of categorical product of graphs
- On 3-colorings of direct products of graphs
This page was built for publication: The fractional version of Hedetniemi's conjecture is true
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648973)
