Improved lower bounds for multiplicative square-free sequences

DOI10.37236/11477OpenAlexW4389209718MaRDI QIDQ6117250

Máté Vizer, Péter Pál Pach

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/11477

zbMATH Keywords

hypergraph girth problemmultiplicative Sidon problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Other combinatorial number theory (11B75) Extremal combinatorics (05D99)

Cites Work

• Unnamed Item
• Unnamed Item
• 3-uniform hypergraphs avoiding a given odd cycle
• A counterexample to sparse removal
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The Moore bound for irregular graphs
• \(C_ 6\)-free bipartite graphs and product representation of squares
• On hypergraphs of girth five
• On product representation of powers. I
• Generalized multiplicative Sidon sets
• Hypergraphs with No Cycle of a Given Length
• A new series of dense graphs of high girth
• An improved upper bound for the size of the multiplicative 3-Sidon sets
• Minimal Regular Graphs of Girths Eight and Twelve
• Counting hypergraphs with large girth

This page was built for publication: Improved lower bounds for multiplicative square-free sequences