Robuta

https://dmtcs.episciences.org/en/articles/14610 The complexity of recognizing $ABAB$-free hypergraphs | Discrete Mathematics & Theoretical Computer... discrete mathematicscomplexityrecognizingababfree https://math.biu.ac.il/node/3675 Eight times four bialgebras of hypergraphs, cointeractions, and chromatic polynomials | המחלקה... eighttimesfourbialgebrashypergraphs https://journal.hep.com.cn/fmc/EN/10.1007/s11464-017-0626-3 Spectral radius of uniform hypergraphs and degree sequences We present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences. spectral radiusdegree sequencesuniformhypergraphs https://cris.ariel.ac.il/en/publications/on-zarankiewiczs-problem-for-intersection-hypergraphs-of-geometri/ On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects - Ariel University ariel universityzarankiewiczproblemintersectionhypergraphs https://mathcommunities.org/whiteboard/hypergraphs/ The independence polynomial of hypergraphs – MathCommunities.org independencepolynomialhypergraphs https://portal.mardi4nfdi.de/wiki/On_distance_spectral_radius_of_hypergraphs On distance spectral radius of hypergraphs - MaRDI portal spectral radiusdistancehypergraphsmardiportal https://www.sciweavers.org/publications/complexity-hamilton-cycle-problem-hypergraphs-high-minimum-codegree The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree | Sciweavers The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree - We consider the complexity of the Hamilton cycle decision problem when... hamilton cyclecomplexityproblemhypergraphshigh https://researchportal.unamur.be/en/publications/dynamical-systems-on-hypergraphs/fingerprints/ Dynamical systems on hypergraphs - Fingerprint - the Research Portal - University of Namur university of namurdynamical systemsthe researchhypergraphsfingerprint https://pygraphistry.readthedocs.io/en/latest/api/hyper.html Hypergraphs — PyGraphistry Documentation hypergraphsdocumentation https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.34 Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs linearly orderedhardnesscolouringcolourableuniform