Pith. sign in

REVIEW 3 cited by

Embedding the Complete Expansion Graph in Books

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 2003.12922 v1 pith:BMVSPASH submitted 2020-03-29 math.CO

Embedding the Complete Expansion Graph in Books

classification math.CO
keywords embeddinggraphbookcompleteexpansionedgesembeddedgraphs
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

A book embedding of a graph consists of an embedding of its vertices along the spine of a book, and an embedding of its edges on the pages such that edges embedded on the same page do not intersect. The pagenumber is the minimum number of pages in which the graph $G$ can be embedded. The main purpose of this paper is to study the book embedding of the complete expansion graph. This is the first work about it, and some exact pagenumbers of the complete expansion graphs of some special graphs are obtained.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Drop-In Perceptual Optimization for 3D Gaussian Splatting

    cs.CV 2026-03 accept novelty 6.5

    WD-R, a lightly regularized Wasserstein Distortion loss, is preferred by humans 2.3× over the original 3DGS loss and 1.5× over Perceptual-GS while matching or reducing splat count and generalizing to other 3DGS framew...

  2. Spline-Based Boundary Representations for Sparse View Reconstruction and Simulation Using Isogeometric Analysis

    cs.CV 2026-07 conditional novelty 6.0

    FORGE-SIM directly optimizes a six-patch B-spline boundary representation from sparse images and demonstrates isogeometric heat and modal simulations on the reconstructed model.

  3. DS@GT ARC at ImageCLEFmed GANs 2026: Geometric Filtering for Privacy-Preserving CT Slice Generation

    cs.CV 2026-07 conditional novelty 5.0

    Geometric filtering of synthetic CT slices reduces nearest-neighbor and membership-inference leakage, but patient re-identification leakage remains near 0.97–1.0 across all submissions.