Abstract
The classical problem of estimating the number of edges in a subgraph of a special distance graph is considered. Old results are significantly improved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have