Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs

A. Nicholas Day; Allan Lo

doi:10.1016/j.ejc.2022.103625

ScienceGate Book Chapters

JOURNAL ARTICLE

Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs

A. Nicholas Day Allan Lo

Year: 2023 Journal: European Journal of Combinatorics Vol: 110 Pages: 103625-103625 Publisher: Elsevier BV

DOI: 10.1016/j.ejc.2022.103625

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Monochromatic color Bipartite graph Conjecture Vertex (graph theory) Upper and lower bounds Complete bipartite graph Discrete mathematics Graph Physics Mathematical analysis

Metrics

Cited By

0.97

FWCI (Field Weighted Citation Impact)

Refs

0.55

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs

Metrics

Citation History

Topics

Related Documents

MONOCHROMATIC PATHS IN INFINITE COLOURED GRAPHS

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Properly Coloured Hamiltonian Paths in Edge-Coloured Complete Graphs without Monochromatic Triangles.

Monochromatic Partitions in 2-Edge-Coloured Bipartite Graphs