Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 43 min ago
PreprintCC BY 4.0arXiv

Strong complete immersions in graphs with independence number two

  • Zijian Deng
  • Chuanshu Wu
Open at sourcePDFDOICite

Abstract

We prove that every graph G with independence number at most two contains a strong immersion of Kχ(G). This strengthens Dahlke's theorem for weak immersions and establishes the Lescure--Meyniel conjecture for this class of graphs.

Related

  1. Tree-independence number VIII. 3PC-free graphs have logarithmic tree-independence number
    Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S +2
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Connected graphs with equal independence number and radius
    Xingzhi Zhan
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Independence number, essential connectivity and the distance spectral radius of graphs
    Shuang Ding, Dan Li, Yuanyuan Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. On the Stability of the Independence Number in Random Distance Graphs
    Vsevolod A. Pokhachevskiy, Andrei Raigorodskii
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  5. Biplanar graphs with independence number two are 9-colorable
    Stefan Szeider
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{deng2026strong,
  title = {{Strong complete immersions in graphs with independence number two}},
  author = {Zijian Deng and Chuanshu Wu},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.00956},
  eprint = {2611.00956},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.00956},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Strong complete immersions in graphs with independence number two
AU  - Zijian Deng
AU  - Chuanshu Wu
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.00956
UR  - https://arxiv.org/abs/2611.00956
AB  - We prove that every graph G with independence number at most two contains a strong immersion of K_χ(G). This strengthens Dahlke's theorem for weak immersions and establishes the Lescure--Meyniel conjecture for this class of graphs.
ER  -