Tight cycles and regular slices in dense hypergraphs (Q516070): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1411.4957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest cycle of a graph with a large minimal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in balanced \(k\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in dense vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for hypergraphs and quasi-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak hypergraph regularity and linear hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs, quasi-randomness, and conditions for regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(R(C_n,C_n,C_n)\leqq (4+o(1))n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle lengths in graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Counting Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Regularity Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite graphs with cycles of all even lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Revision as of 13:24, 13 July 2024

scientific article
Language Label Description Also known as
English
Tight cycles and regular slices in dense hypergraphs
scientific article

    Statements

    Tight cycles and regular slices in dense hypergraphs (English)
    0 references
    0 references
    0 references
    20 March 2017
    0 references
    hypergraphs
    0 references
    cycles
    0 references
    regularity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers