scientific article; zbMATH DE number 3523543
From MaRDI portal
Publication:4101818
Recommendations
Cited in
(70)- A note on the Erdős--Farber--Lovász conjecture
- The Erdős-Faber-Lovász conjecture for dense hypergraphs
- scientific article; zbMATH DE number 3715594 (Why is no real title available?)
- On chromatic indices of finite affine spaces
- Further results on Erdős-Faber-Lovász conjecture
- The Spectrum of Triangle-Free Graphs
- b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
- On the harmonious chromatic number of graphs
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Nested cycles with no geometric crossings
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Linear trees in uniform hypergraphs
- Dense induced bipartite subgraphs in triangle-free graphs
- scientific article; zbMATH DE number 3285262 (Why is no real title available?)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Nested cycles with no geometric crossings
- Sparse halves in triangle-free graphs
- Forbidding just one intersection
- A short note on supersaturation for oddtown and eventown
- scientific article; zbMATH DE number 3685503 (Why is no real title available?)
- On finite Delta-systems. II
- scientific article; zbMATH DE number 3561377 (Why is no real title available?)
- Research problems from the 5th Slovenian Conference (Bled, 2003)
- More about sparse halves in triangle-free graphs
- Maximal intersecting families and affine regular polygons in PG(2,q)
- \(H\)-wise independence
- scientific article; zbMATH DE number 3749050 (Why is no real title available?)
- Exact solution of some Turán-type problems
- 10 problems for partitions of triangle-free graphs
- On the size of maximal binary codes with 2, 3, and 4 distances
- scientific article; zbMATH DE number 4039909 (Why is no real title available?)
- Linear CNF formulas and satisfiability
- Problems and results in combinatorial analysis and graph theory
- scientific article; zbMATH DE number 3735816 (Why is no real title available?)
- scientific article; zbMATH DE number 736304 (Why is no real title available?)
- Disjoint pairs in set systems with restricted intersection
- Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
- On line colorings of finite projective spaces
- On embedding triangle-free graphs in unit spheres
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Hypergraphs without exponents
- Frankl-Rödl-type theorems for codes and permutations
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- scientific article; zbMATH DE number 7232795 (Why is no real title available?)
- Hypergraph removal lemmas via robust sharp threshold theorems
- Cycles with many chords
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- scientific article; zbMATH DE number 3639656 (Why is no real title available?)
- scientific article; zbMATH DE number 3561378 (Why is no real title available?)
- Chromatic index of simple hypergraphs
- scientific article; zbMATH DE number 3547317 (Why is no real title available?)
- Turán numbers for disjoint paths
- Sparse halves in dense triangle-free graphs
- Integer sequences without singleton intersection
- Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Exact stability for Turán's theorem
- Forbidding just one intersection, for permutations
- Sparse halves in K4‐free graphs
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3959432 (Why is no real title available?)
- scientific article; zbMATH DE number 4085592 (Why is no real title available?)
- Progress of some problems in graph theory
- scientific article; zbMATH DE number 3540832 (Why is no real title available?)
- scientific article; zbMATH DE number 4041937 (Why is no real title available?)
- Combinatorial and graph-theoretical problems and augmenting technique
- Making an H $H$‐free graph k $k$‐colorable
- K4$K_4$‐free graphs have sparse halves
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- On maximal intersecting families of finite sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101818)
