Finding partite hypergraphs efficiently

DOI10.1016/J.IPL.2026.106624MaRDI QIDQ7227486zbMATH OpenFDO

Authors Ferran Espuña

Publication date 10 April 2026

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2026.106624

zbMATH Keywords

algorithmextremal combinatoricsgraphshypergraphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Finding bipartite subgraphs efficiently
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3140515 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• On a problem of K. Zarankiewicz
• On extremal problems of graphs and generalized graphs
• On the Structure of Edge Graphs
• The probabilistic method

This page was built for publication: Finding partite hypergraphs efficiently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227486)