View in EDS HTML Full Text PDF Full Text

Embedding theorems for random graphs with specified degrees.

Saved in:
Bibliographic Details
Title: Embedding theorems for random graphs with specified degrees.
Source: Combinatorics, Probability & Computing. Jan2025, Vol. 34 Issue 1, p1-16. 16p.
Database: Mathematics Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: msf
DbLabel: Mathematics Source
An: 182622011
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Embedding theorems for random graphs with specified degrees.
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Combinatorics%2C+Probability+%26+Computing%22">Combinatorics, Probability & Computing</searchLink>. Jan2025, Vol. 34 Issue 1, p1-16. 16p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=182622011
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1017/S0963548324000300
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 16
        StartPage: 1
    Titles:
      – TitleFull: Embedding theorems for random graphs with specified degrees.
        Type: main
  BibRelationships:
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09635483
          Numbering:
            – Type: volume
              Value: 34
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Combinatorics, Probability & Computing
              Type: main
ResultId 1