Spectral bounds for the independence number of graphs and even uniform hypergraphs

Authors: Xinyu Hu, Jiang Zhou, Changjiang Bu
Publication: Journal of Combinatorial Theory, Series A
Published: Oct 1, 2026
Source: Crossref
Back to Search View Original Cite This Article

Related Articles

ANALYTICAL CLOUD SYSTEM ERI Digital health analysis using Spectral analysis in AI  

Elena van Dijk - Apr 2121

Read More
SPECTRAL MATRIX FOR STURM–LIOUVILLE OPERATORS ON TWO-SIDED UNBOUNDED TIME SCALES

Adil Huseynov - Jul 2103

Read More
A Self-supervised Sub-style Separation Framework for Artistic Painting Classification

Rui Huang, J.I.A. CUI et al. - Jan 2028

Read More
Testing Conditional Tail Independence

Zhaowen Wang, Huixia Judy Wang et al. - Jan 2028

Read More
A Primal Dual Active Set with Continuation Algorithm for ℓ0-penalized High-dimensional Accelerated Failure Time Model

Peili Li, Ruoying Hu et al. - Jan 2028

Read More
Journal Ideas PyMinds Charcha More
PORE

About

About Us

Resources

Help Center Research Guides Citescore

Legal

Terms of Service Privacy Policy Cookie Policy Accessibility

Connect

Contact Us
© 2026 PORE. Content available under CC BY-NC 4.0