Pith. sign in

REVIEW 1 cited by

Results on the intersection graphs of subspaces of a vector space

Not yet reviewed by Pith; the record is open.

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 1105.0803 v1 pith:CKH7QKQZ submitted 2011-05-04 math.CO

classification math.CO
keywords subspacesintersectionnumberspacevectorgraphgraphsnontrivial
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

For a vector space $V$ the \emph{intersection graph of subspaces} of $V$, denoted by $G(V)$, is the graph whose vertices are in a one-to-one correspondence with proper nontrivial subspaces of $V$ and two distinct vertices are adjacent if and only if the corresponding subspaces of $V$ have a nontrivial (nonzero) intersection. In this paper, we study the clique number, the chromatic number, the domination number and the independence number of the intersection graphs of subspaces of a vector space.

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. Distinguishing Number of Non-Zero Component Graphs

    math.CO 2019-08 reject novelty 4.0 of 10

    The paper claims the automorphism group of a nonzero component graph is the symmetric group on the basis and derives distinguishing numbers, but the automorphism claim fails for q≥3 and the q=2 proof has a gap.

Pith tools