Pith. sign in

REVIEW 1 cited by

Maximizing the number of maximal independent sets of a fixed size

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.06066 v2 pith:ZNYI64MW submitted 2020-12-11 math.CO

Chunwei Song , Bowen Yao This is my paper · ORCID
classification math.CO
keywords independentmaximalfixedgraphsnumbersetsextremalgraph
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

For a fixed graph G, a maximal independent set is an independent set that is not a proper subset of any other independent set. P. Erd\"os, and independently, J. W. Moon and L. Moser, and R. E. Miller and D. E. Muller, determined the maximum number of maximal independent sets in a graph on n vertices, as well as the extremal graphs. In this paper we maximize the number of maximal independent sets of a fixed size for all graphs of order n and determine the extremal graphs. Our result generalizes the classical result.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Extremal Properties of k-CNF: Capturing Threshold Functions

    cs.CC 2024-12 conditional novelty 7.0 of 10

    For 2-CNF formulas the maximum number of accepted weight-t assignments is q^{n-t-r}(q+1)^r, and for t=n-k the general problem is equivalent to the Turán problem.

Pith tools