Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pattern avoidance over a hypergraph

From MaRDI portal
Publication:2121745
Jump to:navigation, search

DOI10.37236/9014zbMath1486.05006arXiv1906.09659OpenAlexW4205461450MaRDI QIDQ2121745

Maxwell Fishelson, Benjamin Gunby

Publication date: 4 April 2022

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

Full work available at URL: https://arxiv.org/abs/1906.09659


zbMATH Keywords

\(k\)-uniform hypergraphStanley-Wilf conjecturehypergraph containers method


Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)





Cites Work

  • Unnamed Item
  • The number of \(C_{2\ell}\)-free graphs
  • Hypergraph containers
  • Excluded permutation matrices and the Stanley-Wilf conjecture
  • Davenport-Schinzel theory of matrices
  • Supersaturated Sparse Graphs and Hypergraphs
  • Independent sets in hypergraphs




This page was built for publication: Pattern avoidance over a hypergraph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2121745&oldid=14617964"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki