On a Frankl-Wilson Theorem


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We derive an analog of the Frankl-Wilson theorem on independence numbers of some distance graphs. The obtained results are applied to the problem of the chromatic number of a space ℝn with a forbidden equilateral triangle and to the problem of chromatic numbers of distance graphs with large girth.

About the authors

A. A. Sagdeev

Laboratory of Advanced Combinatorics and Network Applications

Author for correspondence.
Email: xp1@protonmail.com
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Pleiades Publishing, Inc.