Small but unwieldy: a lower bound on adjacency labels for small classes
From MaRDI portal
Publication:6631355
DOI10.1137/23M1618661MaRDI QIDQ6631355
Julien Duron, John Sylvester, Édouard Bonnet, Victor Zamaraev, M. E. Zhukovskii
Publication date: 1 November 2024
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) General topics of discrete mathematics in relation to computer science (68R01) Combinatorics in computer science (68R05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramsey graphs contain many distinct induced subgraphs
- Growth constants of minor-closed classes of graphs
- Clique-width and the speed of hereditary properties
- On the number of distinct induced subgraphs of a graph
- Erdős and Rényi conjecture
- Efficient graph representations
- Graphs with a small number of distinct induced subgraphs
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- Proper minor-closed families are small
- The number of trees
- On an elementary proof of some asymptotic formulas in the theory of partitions
- Small cancellation labellings of some infinite graphs and applications
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Implicat Representation of Graphs
- Optimal Induced Universal Graphs and Adjacency Labeling for Trees
- Twin-width II: small classes
- Adjacency Labelling for Planar Graphs (and Beyond)
- Shorter Labeling Schemes for Planar Graphs
- Random Graphs and Networks: A First Course
- Counting subgraphs via homomorphisms
- Randomized communication and implicit graph representations
- Logical labeling schemes
- Graph parameters, implicit representations and factorial properties
- Optimization in graphical small cancellation theory
- Twin-width and permutations
This page was built for publication: Small but unwieldy: a lower bound on adjacency labels for small classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631355)
