Density of balanced 3-partite graphs without 3-cycles or 4-cycles (Q2112583): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.37236/10958 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313292816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers of bipartite graphs plus an odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edges in graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5771387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs without three‐cycles or four‐cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4024328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: General properties of some families of graphs defined by systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zarankiewicz problem in 3‐partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:33, 31 July 2024

scientific article
Language Label Description Also known as
English
Density of balanced 3-partite graphs without 3-cycles or 4-cycles
scientific article

    Statements

    Density of balanced 3-partite graphs without 3-cycles or 4-cycles (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2023
    0 references
    Summary: Let \(C_k\) be a cycle of order \(k\), where \(k\geqslant 3\). Let \(\mathrm{ex}(n, n, n, \{C_3, C_4\})\) be the maximum number of edges in a balanced \(3\)-partite graph whose vertex set consists of three parts, each has \(n\) vertices that has no subgraph isomorphic to \(C_3\) or \(C_4\). We construct dense balanced 3-partite graphs without 3-cycles or 4-cycles and show that \(\mathrm{ex}(n, n, n, \{C_3, C_4\})\geqslant (\frac{6\sqrt{2}-8}{(\sqrt{2}-1)^{3/2}}+o(1))n^{3/2}\).
    0 references
    balanced 3-partite graph
    0 references

    Identifiers

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