A bound on the inducibility of cycles (Q1621427): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Serguei Norine / rank
Normal rank
 
Property / author
 
Property / author: Serguei Norine / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57601310 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2781906402 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.01556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of induced \(r\)-partite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of induced complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inducibility of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inducibility of blow-up graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inducibility of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Inducibility of Graphs on Four Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inducibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:04, 17 July 2024

scientific article
Language Label Description Also known as
English
A bound on the inducibility of cycles
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references