Largest digraphs contained in all n-tournaments

N. Linial; M. Saks; Vera T. Sós

doi:10.1007/BF02579345

Largest digraphs contained in all n-tournaments

N. Linial^*, M. Saks, Vera T. Sós

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

Let f(n) (resp. g(n)) be the largest m such that there is a digraph (resp. a spanning weakly connected digraph) on n-vertices and m edges which is a subgraph of every tournament on n-vertices. We prove that {Mathematical expression}

Original language	American English
Pages (from-to)	101-104
Number of pages	4
Journal	Combinatorica
Volume	3
Issue number	1
DOIs	https://doi.org/10.1007/BF02579345
State	Published - Mar 1983

Keywords

AMS subject classification (1980): 05C20, 05C35, 05C55

Access to Document

10.1007/BF02579345

Cite this

@article{1c0871947be64c2bbb10d4fbe39057ac,

title = "Largest digraphs contained in all n-tournaments",

abstract = "Let f(n) (resp. g(n)) be the largest m such that there is a digraph (resp. a spanning weakly connected digraph) on n-vertices and m edges which is a subgraph of every tournament on n-vertices. We prove that {Mathematical expression}",

keywords = "AMS subject classification (1980): 05C20, 05C35, 05C55",

author = "N. Linial and M. Saks and S{\'o}s, {Vera T.}",

year = "1983",

month = mar,

doi = "10.1007/BF02579345",

language = "American English",

volume = "3",

pages = "101--104",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Largest digraphs contained in all n-tournaments

AU - Linial, N.

AU - Saks, M.

AU - Sós, Vera T.

PY - 1983/3

Y1 - 1983/3

N2 - Let f(n) (resp. g(n)) be the largest m such that there is a digraph (resp. a spanning weakly connected digraph) on n-vertices and m edges which is a subgraph of every tournament on n-vertices. We prove that {Mathematical expression}

AB - Let f(n) (resp. g(n)) be the largest m such that there is a digraph (resp. a spanning weakly connected digraph) on n-vertices and m edges which is a subgraph of every tournament on n-vertices. We prove that {Mathematical expression}

KW - AMS subject classification (1980): 05C20, 05C35, 05C55

UR - http://www.scopus.com/inward/record.url?scp=51249184833&partnerID=8YFLogxK

U2 - 10.1007/BF02579345

DO - 10.1007/BF02579345

M3 - Article

AN - SCOPUS:51249184833

SN - 0209-9683

VL - 3

SP - 101

EP - 104

JO - Combinatorica

JF - Combinatorica

IS - 1

ER -

Largest digraphs contained in all n-tournaments

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this