The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs. An efficient testing algorithm
Saved in:
| Main Authors: | Halina Bielak, Kamil Powroźnik |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2015-10-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_5/pliks/260.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An efficient algorithm for the density Turán problem of some unicyclic graphs
by: Halina Bielak, et al.
Published: (2014-09-01) -
Generalized Ramsey–Turán density for cliques
by: Jun Gao, et al.
Published: (2025-01-01) -
The generalized Turán problem of two intersecting cliques
by: Erica Liu, et al.
Published: (2025-01-01) -
The spectral Turán problem about graphs of given size with forbidden subgraphs
by: Amir Rehman, et al.
Published: (2025-01-01) -
Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
by: Qiannan Niu, et al.
Published: (2021-01-01)