Free trees and the optimal bound in Wehrung's theorem
From MaRDI portal
Publication:5451612
Recommendations
- scientific article; zbMATH DE number 3855139
- An improved lower bound for the elementary theories of trees
- Random free trees and forests with constraints on multiplicities of vertices
- On the Erdős–Sós conjecture for trees with bounded degree
- The extremal numbers of leaf-free independent sets in trees
- scientific article; zbMATH DE number 1262188
- scientific article; zbMATH DE number 4177078
- scientific article; zbMATH DE number 4023311
- scientific article; zbMATH DE number 933181
- Upper bounds for a Ramsey theorem for trees
Cited in
(14)- Representing an isotone map between two bounded ordered sets by principal lattice congruences
- The ordered set of principal congruences of a countable lattice.
- Infinite combinatorial issues raised by lifting problems in universal algebra
- Categories of partial algebras for critical points between varieties of algebras.
- Non-representable distributive semilattices
- The first omega alephs: from simplices to trees of trees to higher walks
- Cometic functors and representing order-preserving maps by principal lattice congruences
- The possible values of critical points between strongly congruence-proper varieties of algebras
- On the largest numbers of congruences of finite lattices
- A solution to Dilworth's congruence lattice problem
- Representing some families of monotone maps by principal lattice congruences
- Representing a monotone map by principal lattice congruences
- Finite distributive lattices are congruence lattices of almost-geometric lattices
- Evaporation schemes in congruence lattices of majority algebras
This page was built for publication: Free trees and the optimal bound in Wehrung's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451612)
