Triangle-Free Graphs with Large Degree

Authors:
C. C. Chen;G. P. Jin;K. M. Koh
Affiliations:
Department of Mathematics, National University of Singapore, Kent Ridge, Singapore 0511 and Department of Pure Mathematics and Mathematical Statistics, 16 Mill Lane, Cambridge CB2 1SB, UK/ (e-mail ...;Department of Mathematics, National University of Singapore, Kent Ridge, Singapore 0511 and Department of Pure Mathematics and Mathematical Statistics, 16 Mill Lane, Cambridge CB2 1SB, UK/ (e-mail ...;Department of Mathematics, National University of Singapore, Kent Ridge, Singapore 0511 and Department of Pure Mathematics and Mathematical Statistics, 16 Mill Lane, Cambridge CB2 1SB, UK/ (e-mail ...
Venue:
Combinatorics, Probability and Computing
Year:
1997

Citing 2
Cited 3

Triangle-free four-chromatic graphs

Discrete Mathematics
Extremal Graph Theory

Extremal Graph Theory

A 4-colour problem for dense triangle-free graphs

Discrete Mathematics
On the Structure of Dense Triangle-Free Graphs

Combinatorics, Probability and Computing
Note: The binding number of a graph and its cliques

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Gaussian algorithm for lattice reduction in dimension 2 is analysed under its standard version. It is found that, when applied to random inputs in a continuous model, the complexity is constant on average, its probability distribution decays geometrically, ...