A bipartite analogue of Dilworth's theorem
type: Item
instance of: scholarly article
title: A bipartite analogue of Dilworth's theorem
zbMATH Open document ID: 1108.06002
author: Jacob Fox
published in: Order
publication date: 2007-01-25T00:00:00Z
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 5118508
zbMATH Keywords: Ramanujan graph
zbMATH Keywords: convex compact sets
MaRDI profile type: Publication
full work available at URL: s11083-006-9043-z
OpenAlex ID: W2039857505
cites work: Eigenvalues and expanders
cites work: Ramsey graphs cannot be defined by real polynomials
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Crossing patterns of semi-algebraic sets
cites work: Simulating independence
cites work: Q4938791
cites work: Q3286847
cites work: Cubic Ramanujan graphs
cites work: The strong perfect graph theorem
cites work: A decomposition theorem for partially ordered sets
cites work: Q4525053
cites work: Q5759552
cites work: A bipartite analogue of Dilworth's theorem for multiple partial orders
cites work: Q3752383
cites work: The structure of Sperner k-families
cites work: A Ramsey-Type Result for Convex Sets
cites work: Ramanujan graphs
cites work: Good splitters for counting points in triangles
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: Q4450526
cites work: Crossing patterns of segments
cites work: Some geometric applications of Dilworth's theorem
cites work: Q5474627
cites work: Q5465363
cites work: On a property of the class of n-colorable graphs
cites work: Geometric graphs with few disjoint edges
cites work: Q4004146
DOI: 10.1007/S11083-006-9043-Z
description: scientific article; zbMATH DE number 5118508