Turán-type bounds for distance graphs (Q2411797)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Turán-type bounds for distance graphs	scientific article

Statements

scholarly article

0 references

Turán-type bounds for distance graphs (English)

0 references

Doklady Mathematics

0 references

publication date

25 October 2017

0 references

Lev E. Shabanov

0 references

Andrei M. Raigorodskii

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Mathematical Coloring Book

0 references

0 references

On Sets of Distances of n Points

0 references

Turán type results for distance graphs

0 references

Independence, clique size and maximum degree

0 references

Lower bounds on size and independence inK4-free graphs

0 references

Estimate for the chromatic number of Euclidean space with several forbidden distances

0 references

On the measurable chromatic number of a space of dimension \(n \leq 24\)

0 references

A new estimate for the number of edges in induced subgraphs of a special distance graph

0 references

New lower bound for the chromatic number of a rational space with one and two forbidden distances

0 references

On Schur's conjecture in \(\mathbb R^4\)

0 references

full work available at URL

https://doi.org/10.1134/s1064562417040135

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S1064562417040135

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2411797

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2411797&oldid=37096612"