Hypergraphs without complete partite subgraphs

DOI10.1017/S0963548325100321MaRDI QIDQ7303691zbMATH OpenFDO

Authors Dhruv Mubayi

Publication date 24 July 2026

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0963548325100321

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
• Applying extremal graph theory to a question on finite groups
• Extremal graphs without exponentially small bicliques
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 1256780 (Why is no real title available?)
• Multidimensional van der Corput and sublevel set estimates
• Norm-graphs and bipartite Turán numbers
• Norm-graphs: Variations and applications
• On extremal problems of graphs and generalized graphs
• On Graphs that do not Contain a Thomsen Graph
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Random multilinear maps and the Erdős box problem
• Remarks on the box problem
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• Some extremal results on complete degenerate hypergraphs
• Sparse Rademacher chaos in symmetric spaces
• Squarefree polynomials with prescribed coefficients

This page was built for publication: Hypergraphs without complete partite subgraphs

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