Polynomial reconstruction problem for hypergraphs
From MaRDI portal
Publication:6496383
DOI10.1016/J.LAA.2024.03.029MaRDI QIDQ6496383FDOQ6496383
Authors: Joshua Cooper, Utku Okur
Publication date: 3 May 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Spectra of uniform hypergraphs
- Recent results in the theory of graph spectra
- A congruence theorem for trees
- A family of non-reconstructible hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The polynomial reconstruction problem: the first 50 years
This page was built for publication: Polynomial reconstruction problem for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496383)