Largest digraphs contained in alln-tournaments View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

1983-03

AUTHORS

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

ABSTRACT

Letf(n) (resp.g(n)) be the largestm such that there is a digraph (resp. a spanning weakly connected digraph) onn-vertices andm edges which is a subgraph of every tournament onn-vertices. We prove that\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$n\log _2 n - c_1 n \geqq f(n) \geqq g(n) \geqq n\log _2 n - c_2 n\log \log n.$$ \end{document} More... »

PAGES

101-104

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf02579345

DOI

http://dx.doi.org/10.1007/bf02579345

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1002057668


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute of Mathematics and Computer Science Hebrew University, 91904, Jerusalem, Israel", 
          "id": "http://www.grid.ac/institutes/grid.9619.7", 
          "name": [
            "Institute of Mathematics and Computer Science Hebrew University, 91904, Jerusalem, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Linial", 
        "givenName": "N.", 
        "id": "sg:person.015760032537.47", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015760032537.47"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Mathematics, Rutgers University, 08903, New Brunswick, N. J., USA", 
          "id": "http://www.grid.ac/institutes/grid.430387.b", 
          "name": [
            "Department of Mathematics, Rutgers University, 08903, New Brunswick, N. J., USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Saks", 
        "givenName": "M.", 
        "id": "sg:person.011520224512.05", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011520224512.05"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Analysis I., E\u00f6tv\u00f6s University, H-1088, Budapest, Hungary", 
          "id": "http://www.grid.ac/institutes/grid.5591.8", 
          "name": [
            "Department of Analysis I., E\u00f6tv\u00f6s University, H-1088, Budapest, Hungary"
          ], 
          "type": "Organization"
        }, 
        "familyName": "S\u00f3s", 
        "givenName": "Vera T.", 
        "id": "sg:person.012253477620.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012253477620.46"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf02476378", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028435608", 
          "https://doi.org/10.1007/bf02476378"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1983-03", 
    "datePublishedReg": "1983-03-01", 
    "description": "Letf(n) (resp.g(n)) be the largestm such that there is a digraph (resp. a spanning weakly connected digraph) onn-vertices andm edges which is a subgraph of every tournament onn-vertices. We prove that\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}\n$$n\\log _2 n - c_1 n \\geqq f(n) \\geqq g(n) \\geqq n\\log _2 n - c_2 n\\log \\log n.$$\n\\end{document}", 
    "genre": "article", 
    "id": "sg:pub.10.1007/bf02579345", 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1136493", 
        "issn": [
          "0209-9683", 
          "1439-6912"
        ], 
        "name": "Combinatorica", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "3"
      }
    ], 
    "keywords": [
      "andm", 
      "digraphs", 
      "subgraphs", 
      "large digraphs"
    ], 
    "name": "Largest digraphs contained in alln-tournaments", 
    "pagination": "101-104", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1002057668"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02579345"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02579345", 
      "https://app.dimensions.ai/details/publication/pub.1002057668"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-10-01T06:27", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221001/entities/gbq_results/article/article_167.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/bf02579345"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf02579345'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf02579345'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf02579345'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf02579345'


 

This table displays all metadata directly associated to this object as RDF triples.

85 TRIPLES      21 PREDICATES      30 URIs      21 LITERALS      6 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf02579345 schema:about anzsrc-for:01
2 anzsrc-for:08
3 schema:author Nad1da805c4dc4221b621f34310460ace
4 schema:citation sg:pub.10.1007/bf02476378
5 schema:datePublished 1983-03
6 schema:datePublishedReg 1983-03-01
7 schema:description Letf(n) (resp.g(n)) be the largestm such that there is a digraph (resp. a spanning weakly connected digraph) onn-vertices andm edges which is a subgraph of every tournament onn-vertices. We prove that\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$n\log _2 n - c_1 n \geqq f(n) \geqq g(n) \geqq n\log _2 n - c_2 n\log \log n.$$ \end{document}
8 schema:genre article
9 schema:isAccessibleForFree true
10 schema:isPartOf Nc316ab3804b54f4e8a4b439251b55bfd
11 Nef5b5808d3fd46de82d9275694e76fc3
12 sg:journal.1136493
13 schema:keywords andm
14 digraphs
15 large digraphs
16 subgraphs
17 schema:name Largest digraphs contained in alln-tournaments
18 schema:pagination 101-104
19 schema:productId Ncff0e775b0cf488abb02898d17ecebe4
20 Nf5d06680ce2d460c9463a7fbd071deb4
21 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002057668
22 https://doi.org/10.1007/bf02579345
23 schema:sdDatePublished 2022-10-01T06:27
24 schema:sdLicense https://scigraph.springernature.com/explorer/license/
25 schema:sdPublisher N26a0b57ca0224469a111a9f3a131a85e
26 schema:url https://doi.org/10.1007/bf02579345
27 sgo:license sg:explorer/license/
28 sgo:sdDataset articles
29 rdf:type schema:ScholarlyArticle
30 N13a41ddc66a94c42894a4579f12144c7 rdf:first sg:person.011520224512.05
31 rdf:rest N3e030e53404c4334b73869609a542c19
32 N26a0b57ca0224469a111a9f3a131a85e schema:name Springer Nature - SN SciGraph project
33 rdf:type schema:Organization
34 N3e030e53404c4334b73869609a542c19 rdf:first sg:person.012253477620.46
35 rdf:rest rdf:nil
36 Nad1da805c4dc4221b621f34310460ace rdf:first sg:person.015760032537.47
37 rdf:rest N13a41ddc66a94c42894a4579f12144c7
38 Nc316ab3804b54f4e8a4b439251b55bfd schema:issueNumber 1
39 rdf:type schema:PublicationIssue
40 Ncff0e775b0cf488abb02898d17ecebe4 schema:name dimensions_id
41 schema:value pub.1002057668
42 rdf:type schema:PropertyValue
43 Nef5b5808d3fd46de82d9275694e76fc3 schema:volumeNumber 3
44 rdf:type schema:PublicationVolume
45 Nf5d06680ce2d460c9463a7fbd071deb4 schema:name doi
46 schema:value 10.1007/bf02579345
47 rdf:type schema:PropertyValue
48 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
49 schema:name Mathematical Sciences
50 rdf:type schema:DefinedTerm
51 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
52 schema:name Information and Computing Sciences
53 rdf:type schema:DefinedTerm
54 sg:journal.1136493 schema:issn 0209-9683
55 1439-6912
56 schema:name Combinatorica
57 schema:publisher Springer Nature
58 rdf:type schema:Periodical
59 sg:person.011520224512.05 schema:affiliation grid-institutes:grid.430387.b
60 schema:familyName Saks
61 schema:givenName M.
62 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011520224512.05
63 rdf:type schema:Person
64 sg:person.012253477620.46 schema:affiliation grid-institutes:grid.5591.8
65 schema:familyName Sós
66 schema:givenName Vera T.
67 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012253477620.46
68 rdf:type schema:Person
69 sg:person.015760032537.47 schema:affiliation grid-institutes:grid.9619.7
70 schema:familyName Linial
71 schema:givenName N.
72 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015760032537.47
73 rdf:type schema:Person
74 sg:pub.10.1007/bf02476378 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028435608
75 https://doi.org/10.1007/bf02476378
76 rdf:type schema:CreativeWork
77 grid-institutes:grid.430387.b schema:alternateName Department of Mathematics, Rutgers University, 08903, New Brunswick, N. J., USA
78 schema:name Department of Mathematics, Rutgers University, 08903, New Brunswick, N. J., USA
79 rdf:type schema:Organization
80 grid-institutes:grid.5591.8 schema:alternateName Department of Analysis I., Eötvös University, H-1088, Budapest, Hungary
81 schema:name Department of Analysis I., Eötvös University, H-1088, Budapest, Hungary
82 rdf:type schema:Organization
83 grid-institutes:grid.9619.7 schema:alternateName Institute of Mathematics and Computer Science Hebrew University, 91904, Jerusalem, Israel
84 schema:name Institute of Mathematics and Computer Science Hebrew University, 91904, Jerusalem, Israel
85 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...