Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.11814 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909497380831232 |
|---|---|
| author | Aldi, Marco Gabrielsen, Thor Grandini, Daniele Harris, Joy Kelley, Kyle |
| author_facet | Aldi, Marco Gabrielsen, Thor Grandini, Daniele Harris, Joy Kelley, Kyle |
| contents | We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_11814 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs Aldi, Marco Gabrielsen, Thor Grandini, Daniele Harris, Joy Kelley, Kyle Combinatorics We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph. |
| title | An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2502.11814 |