A randomized construction of high girth regular graphs (Q6073632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4633868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sextet construction for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for cubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The triangle-free process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large girth approximate Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrainted graph processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A High Girth Graph Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs of large girth and arbitrary degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of a random maximal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tail probabilities for martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Alon’s second eigenvalue conjecture and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the girth of random Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random greedy triangle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of multivariate polynomials and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random <i>k</i>‐matching‐free process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random maximalH-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Final Size of the<i>C</i><sub>4</sub>-Free Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Final Size of the $C_{\ell}$-free Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graph Processes with Degree Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>C</i><sub>ℓ</sub>‐free process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Method of Typical Bounded Differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girths of bipartite sextet graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938890 / rank
 
Normal rank

Latest revision as of 04:26, 3 August 2024

scientific article; zbMATH DE number 7748486
Language Label Description Also known as
English
A randomized construction of high girth regular graphs
scientific article; zbMATH DE number 7748486

    Statements

    A randomized construction of high girth regular graphs (English)
    0 references
    0 references
    0 references
    11 October 2023
    0 references
    graph processes
    0 references
    high-girth graphs
    0 references
    random greedy algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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