Counting trees in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4216032 (Why is no real title available?)
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Compactness results in extremal graph theory
- Matrix power inequalities and the number of walks in graphs
- The Moore bound for irregular graphs
- Tree-minimal graphs are almost regular
Cited in
(12)- scientific article; zbMATH DE number 409493 (Why is no real title available?)
- Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
- Counting labels in binary trees
- Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees
- A clique-free pseudorandom subgraph of the pseudo polarity graph
- Tree-minimal graphs are almost regular
- Unified approach to the generalized Turán problem and supersaturation
- Counting special families of labelled trees
- Off-diagonal book Ramsey numbers
- scientific article; zbMATH DE number 5305008 (Why is no real title available?)
- scientific article; zbMATH DE number 398970 (Why is no real title available?)
- Counting trees using symmetries
This page was built for publication: Counting trees in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q311564)