Image de couverture de livre

A lower bound on the number of colours needed to nicely colour a sphere

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ágoston, Péter
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics 05C10
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the range of two-distance graphs
par: Ágoston, Péter
Publié: (2026)

A note on interval colourings of graphs
par: Axenovich, Maria, et autres
Publié: (2023)

Canonical colourings in random graphs
par: Kamčev, Nina, et autres
Publié: (2023)

Kempe equivalence of 4-colourings of some plane triangulations
par: Florek, Jan
Publié: (2025)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
par: Ágoston, Péter, et autres
Publié: (2025)

A dichotomy theorem for $Γ$-switchable $H$-colouring on $m$-edge coloured graphs
par: Brewster, Richard, et autres
Publié: (2023)

On the two-colour Rado number for $\sum_{i=1}^m a_ix_i=c$
par: Arora, Ishan, et autres
Publié: (2024)

A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
par: Hollom, Lawrence
Publié: (2024)

A conditional lower bound for the Turán number of spheres
par: Newman, Andrew, et autres
Publié: (2024)

When $t$-intersecting hypergraphs admit bounded $c$-strong colourings
par: Hendrey, Kevin, et autres
Publié: (2024)

Planar 1-ended graphs can be periodically coloured
par: Waite, Luke
Publié: (2026)

Perfect colourings of simplices and hypercubes in dimension four and five with few colours
par: Frettlöh, Dirk
Publié: (2024)

Flip colouring of graphs II
par: Mifsud, Xandru
Publié: (2024)

A necessary and sufficient condition for bounds on the sum of a list of real numbers and its applications
par: Yang, Xiwu
Publié: (2024)

A lower bound on the number of edges in DP-critical graphs
par: Bradshaw, Peter, et autres
Publié: (2024)

Colouring random graphs: Tame colourings
par: Heckel, Annika, et autres
Publié: (2023)

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
par: Ágoston, Péter, et autres
Publié: (2024)

Polynomial bounds for monochromatic tight cycle partition in $r$-edge-coloured $K_n^{(k)}$
par: Bandyopadhyay, Debmalya, et autres
Publié: (2024)

Cayley colour integral groups
par: Poddar, Sauvik, et autres
Publié: (2026)

Limits of degeneracy for colouring graphs with forbidden minors
par: Norin, Sergey, et autres
Publié: (2023)

A note on graphs of $k$-colourings
par: Hogan, Emma, et autres
Publié: (2024)

Sharp bounds for product and sum throttling numbers
par: Blair, Ryan, et autres
Publié: (2025)

Algebraic degree of Cayley colour graphs
par: Poddar, Sauvik
Publié: (2026)

Resistance, oddness and colouring defect of snarks
par: Allie, Imran
Publié: (2024)

On list extensions of the majority edge colourings
par: Pękała, Paweł, et autres
Publié: (2025)

Graph colouring and Steenrod's problem for Stanley-Reisner rings
par: Stanley, Donald, et autres
Publié: (2025)

Fractionally colouring $P_5$-free graphs
par: Nguyen, Tung H.
Publié: (2025)

Skewness, crossing number and Euler's bound for graphs on surfaces
par: Kainen, Paul C.
Publié: (2025)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
par: Bradshaw, Peter, et autres
Publié: (2024)

Chromatic numbers for facet colouring of some generalised associahedra
par: Baralic, Djordje, et autres
Publié: (2023)

On perfect matchings, edge-colourings and eigenvalues of cubic graphs
par: Haemers, Willem H.
Publié: (2026)

Weak colourings of Kirkman triple systems
par: Burgess, Andrea C., et autres
Publié: (2024)

Berge's conjecture for cubic graphs with small colouring defect
par: Karabáš, Ján, et autres
Publié: (2022)

A general lower bound for the domination number of cylindrical graphs
par: Carreño, José Juan, et autres
Publié: (2018)

On equitably 2-colourable odd cycle decompositions
par: Burgess, Andrea, et autres
Publié: (2023)

Uniquely 2-colourable 4-cycle decompositions
par: Burgess, Andrea C., et autres
Publié: (2026)

$2$-colourability of the maximum ranked elements of a combinatorially sphere-like ranked poset
par: Mondal, Anupam, et autres
Publié: (2026)

Reconfiguration of vertex colouring and forbidden induced subgraphs
par: Belavadi, Manoj, et autres
Publié: (2022)

An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers
par: Solé-Pi, Oriol
Publié: (2024)

Improved bounds on the cop number when forbidding a minor
par: Kenter, Franklin, et autres
Publié: (2023)