New bounds on even cycle creating Hamiltonian paths using expander graphs (Q2220967): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W3009383418 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1904.04601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of sets and permutations: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Additive Combinatorics of Permutations of \mathbb{Z}_n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Size of Reverse-Free Sets of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Separation by Short Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of permutations with given maximal or minimal distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound on Zarankiewicz' Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reverse-Free Codes and Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mean value estimate for real character sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-different Hamiltonian paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $k$-Neighbor Separated Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise colliding permutations and the capacity of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Different Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of Graph-different Hamilton Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of locally separated Hamilton paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-Doubling Graph Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On types of growth for graph-different permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Hamilton cycles in pseudo-random graphs / 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: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / 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: Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even cycle creating paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidences and the spectra of graphs / rank
 
Normal rank

Latest revision as of 09:37, 24 July 2024

scientific article
Language Label Description Also known as
English
New bounds on even cycle creating Hamiltonian paths using expander graphs
scientific article

    Statements

    New bounds on even cycle creating Hamiltonian paths using expander graphs (English)
    0 references
    0 references
    0 references
    25 January 2021
    0 references
    Hamiltonian paths
    0 references
    expander graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers

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