Pages that link to "Item:Q1356747"
From MaRDI portal
The following pages link to Some old and new problems in various branches of combinatorics (Q1356747):
Displaying 29 items.
- Sparse halves in dense triangle-free graphs (Q490981) (← links)
- On \(q\)-power cycles in cubic graphs (Q503679) (← links)
- Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics (Q1139618) (← links)
- Erdős-Gyárfás conjecture for some families of Cayley graphs (Q1692278) (← links)
- Erdős-Gyárfás conjecture for cubic planar graphs (Q1953482) (← links)
- Erdős-Gyárfás conjecture for \(P_8\)-free graphs (Q2084789) (← links)
- Gaps in the cycle spectrum of 3-connected cubic planar graphs (Q2221919) (← links)
- On a conjecture of Bondy and Vince (Q2284740) (← links)
- On the local density problem for graphs of given odd-girth (Q2413148) (← links)
- Sparse halves in triangle-free graphs (Q2496210) (← links)
- On the Erdős-Gyárfás conjecture in claw-free graphs (Q2509554) (← links)
- More about sparse halves in triangle-free graphs (Q3391027) (← links)
- Some old and new problems in combinatorial geometry (Q3675063) (← links)
- (Q3866151) (← links)
- (Q3872528) (← links)
- Problems in number theory and combinatorics (Q3924258) (← links)
- A Selection of Problems and Results in Combinatorics (Q4243068) (← links)
- Some of may favourite problems in various branches of combinatorics (Q4288119) (← links)
- Open problems of Paul Erd�s in graph theory (Q4337503) (← links)
- (Q4988791) (← links)
- (Q4990108) (← links)
- On 2-power unicyclic cubic graphs (Q5081236) (← links)
- Sparse halves in K4‐free graphs (Q6056789) (← links)
- K4$K_4$‐free graphs have sparse halves (Q6096775) (← links)
- Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New (Q6143998) (← links)
- The Spectrum of Triangle-Free Graphs (Q6157996) (← links)
- A solution to Erdős and Hajnal’s odd cycle problem (Q6165143) (← links)
- The Erdős-Gsyárfás conjecture holds for \(P_{10}\)-free graphs (Q6611727) (← links)
- 10 problems for partitions of triangle-free graphs (Q6612517) (← links)