descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1994 English Publisher:Springer Science and Business Media LLCJournal:Order, volume 11, pages 159-167 (issn: 0167-8094, eissn: 1572-9273,

Authors: Graham Brightwell; William T. Trotter; William T. Trotter;

doi: 10.1007/bf01108600

Incidence posets of trees in posets of large dimension

- Summary
- Subjects
- Metrics

Abstract

The principal result of this paper is the following theorem: For each positive integer \(n\), if \(T\) is a tree on \(n\) vertices and if \(P\) is any poset having dimension at least \(4n^ 6\), then either \(P\) or its dual contains the incidence poset of \(T\) as a suborder.

Related Organizations

Arizona State University
United States
London School of Economics and Political Science
United Kingdom
Telcordia Technologies
United States
Core Competence
United States

Keywords

Combinatorics of partially ordered sets, partially ordered set, incidence poset, Extremal problems in graph theory, dimension, suborder, tree

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average