z-logo
HomeZAIABlog
open-access-imgOpen Access
Maximal Midpoint-Free Subsets of Integers
Author(s) -
Roger B. Eggleton
Publication year - 2015
Publication title -
international journal of combinatorics
Language(s) - English
Resource type - Journals
eISSN - 1687-9171
pISSN - 1687-9163
DOI - 10.1155/2015/216475
Subject(s) - algorithm , computer science
A set S⊂Z is midpoint-free if no ordered triple a,b,c∈S3 satisfies a+c=2b and a

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

AboutCareersPublisher PartnersContact UsGet Organisational Trial or Quote

Learn

FAQsBlogTerms of UsePrivacy Policy

Download the Zendy App

Get it on
Google Play
Download on the
App Store

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.