Pith. Sign in

RECORD

On (n, k)-extendable graphs and induced subgraphs

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Guizhen Liu, Qinglin Yu

Combinatorics · Submitted 27 Sep 2006

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In particular, we proved that if $G - V(e)$ is $(n, k)$-extendable graph for each $e \in F$ (where $F$ is a fixed 1-factor in $G$), then $G$ is $(n, k)$-extendable graph.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDmath/0609755 (version 1)
Pith IDDHNNTJ54, Pith's permanent record of this paper and its review
CitationGuizhen Liu, Qinglin Yu. "On (n, k)-extendable graphs and induced subgraphs." arXiv:math/0609755 (2006). https://pith.science/paper/DHNNTJ54
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,409 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.07 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.18 · compares with prior results 0.05 · mentions code or data availability 0.01.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$ edges and every $k$-matching can be extended to a 1-factor, then $G$ is called an $(n, k)-extendable graph. In this paper we present several results about $(n, k)$-extendable graphs and its subgraphs. In particular, we proved that if $G - V(e)$ is $(n, k)$-extendable graph for each $e \in F$ (where $F$ is a fixed 1-factor in $G$), then $G$ is $(n, k)$-extendable graph.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Let $G$ be a graph with vertex set $V(G)$. background 1.00 0.04 0.01 unclear 0.58
s1 Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. background 1.00 0.08 0.01 unclear 0.56
s2 If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$ edges and every $k$-matching can be extended to a 1-factor, then $G$ is called an $(n, k)-extendable graph. background 1.00 0.07 0.04 asserted 0.96
s3 In this paper we present several results about $(n, k)$-extendable graphs and its subgraphs. contribution 1.00 0.86 0.06 asserted 0.93
s4 In particular, we proved that if $G - V(e)$ is $(n, k)$-extendable graph for each $e \in F$ (where $F$ is a fixed 1-factor in $G$), then $G$ is $(n, k)$-extendable graph. result 0.99 0.95 0.62 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$ edges and every $k$-matching can be extended to a 1-factor, then $G$ is called an $(n, k)-extendable graph. In this paper we present several results about $(n, k)$-extendable graphs and its subgraphs. In particular, we proved that if $G - V(e)$ is $(n, k)$-extendable graph for each $e \in F$ (where $F$ is a fixed 1-factor in $G$), then $G$ is $(n, k)$-extendable graph.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.