2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

František Franěk; V. Rödl

doi:10.1016/0012-365x(93)90366-2

ScienceGate Book Chapters

JOURNAL ARTICLE

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

František Franěk V. Rödl

Year: 1993 Journal: Discrete Mathematics Vol: 114 (1-3)Pages: 199-203 Publisher: Elsevier BV

DOI: 10.1016/0012-365x(93)90366-2

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Conjecture Graph Ramsey's theorem Discrete mathematics Complement (music) Upper and lower bounds Order (exchange) Simple graph

Metrics

Cited By

0.74

FWCI (Field Weighted Citation Impact)

Refs

0.63

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

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

Metrics

Citation History

Topics

Related Documents

Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number

Online vertex colorings of random graphs without monochromatic subgraphs

Rainbow Subgraphs in Edge-Colorings of Complete Graphs

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring