Induced universal hypergraphs

DOI10.1137/18M1163750MaRDI QIDQ4631098zbMATH OpenOpenAlexFDO

Authors Noga Alon, Nadav Sherman

Publication date 24 April 2019

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/18m1163750

zbMATH Keywords

labelinguniversal hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Asymptotically optimal induced universal graphs
• On universal hypergraphs
• Asymptotically optimal induced decompositions
• On universality of graphs with uniformly distributed edges
• On induced Ramsey numbers for \(k\)-uniform hypergraphs

Cites work

• Adjacency labeling schemes and induced-universal graphs
• Asymptotically optimal induced universal graphs
• Graphs which contain all small graphs
• scientific article; zbMATH DE number 5720940 (Why is no real title available?)
• Implicat Representation of Graphs
• Induced-universal graphs for graphs with bounded maximum degree
• On induced-universal graphs for the class of bounded-degree graphs
• On minimal n-universal graphs
• Optimal induced universal graphs for bounded-degree graphs
• Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• The probabilistic method
• Universal graphs and induced-universal graphs
• Universal graphs and universal functions

Cited in

(8)

• On universality of graphs with uniformly distributed edges
• What must be contained in every oriented k-uniform hypergraph
• Universal arrays
• Asymptotically optimal induced decompositions
• On computing the frequencies of induced subhypergraphs
• Asymptotically optimal induced universal graphs
• On universal hypergraphs
• Induced-universal graphs for graphs with bounded maximum degree

This page was built for publication: Induced universal hypergraphs

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